{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; Pathwidth; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006420895,0.0006914625,0.0007516312,0.002965644,0.002318757,0.002835158,0.001819486,0.001549707,0.01174868],"category_scores_gemma":[0.004897256,0.000775343,0.0006323782,0.002925446,0.003010322,0.00448706,0.001968688,0.001699096,0.0005537843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267732,"about_ca_system_score_gemma":0.0005153008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002000657,"about_ca_topic_score_gemma":0.002783915,"domain_scores_codex":[0.9994684,0.0001249043,0.00002838586,0.000163149,0.00009514209,0.0001200705],"domain_scores_gemma":[0.9942358,0.003836177,0.0008165262,0.0002640039,0.000281855,0.0005656212],"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.0003138575,0.0001109642,0.003822892,0.0003027173,0.00005345027,0.0004815713,0.002128215,0.008582224,0.004698275,0.96088,0.004276466,0.01434947],"study_design_scores_gemma":[0.00005103768,0.00002846483,0.002526664,0.00005150679,0.00003331925,0.0001881306,0.0005666774,0.009477689,0.0007344006,0.9847347,0.001584415,0.00002299843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9297553,0.0009297645,0.01869993,0.001543693,0.00009441121,0.00005166232,0.0005855113,0.0001052892,0.04823425],"genre_scores_gemma":[0.986212,0.000773602,0.004826534,0.0003328621,0.0001299037,0.00007099861,0.0006401128,0.00006920224,0.006944667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01174868,"threshold_uncertainty_score":0.03930324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01738388388004704,"score_gpt":0.2803122943302075,"score_spread":0.2629284104501605,"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."}}