{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495378,0.0005209429,0.0005696086,0.001612772,0.0011536,0.002087002,0.001285456,0.001072944,0.008544609],"category_scores_gemma":[0.001386788,0.0005902245,0.00057324,0.001021732,0.000941603,0.001609883,0.001014956,0.0009468077,0.0003504147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008482052,"about_ca_system_score_gemma":0.0003514723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000729577,"about_ca_topic_score_gemma":0.001320597,"domain_scores_codex":[0.9996015,0.00006890638,0.00002010238,0.0001214004,0.00008753636,0.0001004645],"domain_scores_gemma":[0.9985412,0.0006660839,0.0003046213,0.0001032902,0.00009428156,0.0002904963],"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.001101166,0.0006733522,0.01657667,0.0006197588,0.000141861,0.002403282,0.003140949,0.006520465,0.03875084,0.8901157,0.007500105,0.03245579],"study_design_scores_gemma":[0.0003890697,0.0001930109,0.04270009,0.0001357511,0.0002214553,0.002754707,0.001895101,0.04835307,0.01134312,0.8793634,0.0125947,0.00005668042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9634425,0.0002799444,0.01125447,0.0004961891,0.00002975584,0.00006171431,0.0006416588,0.00009971005,0.0236941],"genre_scores_gemma":[0.9890876,0.000151098,0.004819043,0.0001278739,0.00003579758,0.00006676907,0.001383632,0.00003601619,0.004292086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008544609,"threshold_uncertainty_score":0.02858454,"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."}}