{"id":"W33743767","doi":"10.1186/s13019-021-01418-w","title":"New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian (control theory); Hamiltonian path; Graph; Connectivity; Pancyclic graph; Discrete mathematics; Line graph; 1-planar graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935209,0.001197328,0.001147326,0.003672521,0.002141282,0.002048503,0.001967222,0.002613649,0.0277718],"category_scores_gemma":[0.01503677,0.0009512329,0.002041201,0.002019237,0.002690442,0.006371514,0.002849194,0.004527441,0.004055624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001455664,"about_ca_system_score_gemma":0.002020493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002124175,"about_ca_topic_score_gemma":0.004122056,"domain_scores_codex":[0.9986095,0.0003555943,0.0001490625,0.0003327685,0.0002930095,0.0002600728],"domain_scores_gemma":[0.9851165,0.00866257,0.001491781,0.0008314127,0.002185667,0.001712013],"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.000275241,0.0002548974,0.002834466,0.0007206372,0.0000845236,0.002197038,0.0006904898,0.008380359,0.009298705,0.9221197,0.03047095,0.02267294],"study_design_scores_gemma":[0.0001808402,0.0001530744,0.002557046,0.0002123558,0.00009963617,0.001629746,0.000867306,0.03552033,0.003401172,0.9234504,0.03179633,0.0001317674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1442475,0.003580943,0.6222993,0.009892143,0.003086947,0.001387806,0.01377978,0.002385774,0.1993398],"genre_scores_gemma":[0.7560555,0.003572438,0.1970688,0.003042033,0.002345438,0.001832958,0.01314594,0.0006475678,0.0222893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0277718,"threshold_uncertainty_score":0.09290594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02036767941961695,"score_gpt":0.2765313554340319,"score_spread":0.256163676014415,"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."}}