{"id":"W172066816","doi":"","title":"New Conditions for k-ordered Hamiltonian Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Wheel graph; Hamiltonian path; Hamiltonian (control theory); Path graph; Graph; Discrete mathematics; Graph power; Line 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.001096345,0.0007596774,0.0006035753,0.002085268,0.002447311,0.002284838,0.00136913,0.002262661,0.03046405],"category_scores_gemma":[0.009367582,0.0007561888,0.0008326965,0.001357403,0.002263187,0.008269372,0.002964842,0.003136966,0.004932758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211675,"about_ca_system_score_gemma":0.001098489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001437142,"about_ca_topic_score_gemma":0.002479367,"domain_scores_codex":[0.9985619,0.0002758743,0.0001553613,0.0002813887,0.0003670833,0.0003583432],"domain_scores_gemma":[0.9929724,0.00278923,0.0009036352,0.0006572371,0.00112028,0.001557207],"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.0002095077,0.00009177169,0.001045756,0.0002366928,0.00001339961,0.0008998872,0.0004439994,0.002459684,0.005175603,0.9657638,0.01333182,0.01032818],"study_design_scores_gemma":[0.0001451431,0.0001055746,0.001208823,0.0001099684,0.00003255752,0.001431259,0.0008151528,0.01394824,0.004798638,0.9374952,0.03983601,0.00007341562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2133752,0.001795073,0.3381823,0.006935821,0.002787754,0.000735167,0.005070014,0.002099651,0.429019],"genre_scores_gemma":[0.8587178,0.00152374,0.1024569,0.002183927,0.001076225,0.0007694424,0.004424471,0.0005804019,0.02826716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03046405,"threshold_uncertainty_score":0.1019124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01792693594816174,"score_gpt":0.2960958785239048,"score_spread":0.278168942575743,"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."}}