{"id":"W2020320404","doi":"10.1016/j.disc.2010.05.028","title":"Maximum independent sets in 3- and 4-regular Hamiltonian graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Maximal independent set; Hamiltonian path; Chordal graph; Hamiltonian path problem; Discrete mathematics; Hamiltonian (control theory); Pathwidth; Independent set; 1-planar graph; Planar graph; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789217,0.0001707767,0.0002116244,0.0002587767,0.00008973599,0.0001648222,0.0008399645,0.0000942818,0.00001744064],"category_scores_gemma":[0.000115075,0.0001460531,0.00004972595,0.0004441648,0.0001757502,0.0003668616,0.0004804252,0.0004377817,0.0000286941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001309581,"about_ca_system_score_gemma":0.00002933705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006240829,"about_ca_topic_score_gemma":0.00009427447,"domain_scores_codex":[0.9985203,0.00004810119,0.0002688867,0.0003570736,0.0004063584,0.0003992507],"domain_scores_gemma":[0.9987422,0.0001351417,0.00007495555,0.0008518997,0.00004356323,0.0001522425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004348567,0.0000912665,0.002417569,0.00009217719,0.00001365824,0.00006836365,0.003622065,0.00001217532,0.007206535,0.9774435,0.00003421511,0.008994187],"study_design_scores_gemma":[0.0003517185,0.00003536193,0.004363236,0.00003338062,0.000002048679,0.00006071468,0.0002161125,0.0194162,0.001619888,0.9734324,0.0002515474,0.0002174096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8801459,0.00006820673,0.1156218,0.0005879498,0.0002059099,0.0003858827,0.000005967727,0.0001221693,0.002856251],"genre_scores_gemma":[0.8558866,0.00001519955,0.1438429,0.00006548094,0.00001202227,0.00002764436,0.000001802365,0.00002027941,0.0001280212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02822116,"threshold_uncertainty_score":0.5955874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01348230672936073,"score_gpt":0.281595797223699,"score_spread":0.2681134904943382,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}