{"id":"W3198239652","doi":"10.1016/j.disc.2022.112869","title":"Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Induced subgraph; Hamiltonian path; Distance-hereditary graph; Indifference graph; Pancyclic graph; Induced path; Cograph; Discrete mathematics; Chordal graph; Hamiltonian path problem; Pathwidth; Induced subgraph isomorphism problem; Vertex (graph theory); Longest path problem; Line graph; Graph; Graph power; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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.000798534,0.0002116159,0.0004797024,0.0005247967,0.0001777699,0.000031293,0.001831083,0.00004022761,0.00007033256],"category_scores_gemma":[0.0001664892,0.0001991129,0.0002263824,0.001959173,0.0002068829,0.0002471614,0.0009792773,0.0002995199,0.00000408812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002946619,"about_ca_system_score_gemma":0.0001152317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000186749,"about_ca_topic_score_gemma":0.000008349923,"domain_scores_codex":[0.9974985,0.0001904301,0.0006591112,0.0003664136,0.0008734026,0.0004121836],"domain_scores_gemma":[0.9975641,0.0005294318,0.0004542689,0.001158783,0.0001870268,0.0001063641],"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.00003292236,0.0003497361,0.001043168,0.0002611245,0.00008778089,0.00001819479,0.005525427,0.0001757913,0.1175153,0.8740781,0.0000650145,0.0008474713],"study_design_scores_gemma":[0.001795223,0.001179639,0.002278119,0.000110201,0.00004554293,0.00005365019,0.003428604,0.04967229,0.1392488,0.801446,0.0001065123,0.0006354584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9341837,0.00005161421,0.06235495,0.0001051127,0.0001211668,0.0004095789,0.00004877115,0.00007994345,0.002645188],"genre_scores_gemma":[0.9304326,0.000006906544,0.06937189,0.00002315354,0.000006601399,0.00005938275,0.000006656852,0.00002564976,0.00006715307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07263209,"threshold_uncertainty_score":0.8119587,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02732548057777925,"score_gpt":0.3102251781203765,"score_spread":0.2828996975425973,"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."}}