{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","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.0008699677,0.0008810381,0.001537792,0.002349115,0.002824876,0.004203948,0.001783851,0.001728117,0.01479815],"category_scores_gemma":[0.006067705,0.0009031688,0.0009625889,0.003616211,0.00346861,0.008397033,0.002930778,0.002875309,0.001984662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00161028,"about_ca_system_score_gemma":0.0008129536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003143396,"about_ca_topic_score_gemma":0.003057468,"domain_scores_codex":[0.9991115,0.0002608751,0.00003673801,0.0001947608,0.0001840955,0.0002120808],"domain_scores_gemma":[0.9961068,0.002301845,0.0003937375,0.000489263,0.0002760792,0.0004321969],"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.0004117824,0.00006513715,0.001231998,0.0001781609,0.00003252566,0.0001555779,0.001024545,0.01381781,0.001925111,0.9494283,0.009774955,0.02195406],"study_design_scores_gemma":[0.00003848272,0.00002944804,0.0007148065,0.00003982018,0.00001879448,0.0001017039,0.0002576125,0.01718157,0.0002898058,0.9782103,0.003103665,0.00001390315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7016447,0.002110329,0.1898791,0.003538862,0.0003495082,0.0001658128,0.001965601,0.0004546627,0.09989133],"genre_scores_gemma":[0.9174067,0.00222494,0.04529861,0.0007707077,0.0006337317,0.0002482396,0.003881537,0.000521293,0.02901421],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01479815,"threshold_uncertainty_score":0.04950482,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01730689189145129,"score_gpt":0.2803895109935752,"score_spread":0.2630826191021239,"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."}}