{"id":"W2069229408","doi":"10.1016/j.tcs.2011.12.018","title":"Coloring vertices of a graph or finding a Meyniel obstruction","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Graph factorization; Graph power; Discrete mathematics; Graph coloring; 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.0004563101,0.0006875952,0.0009002523,0.0007696277,0.002257773,0.001739409,0.001036619,0.001735643,0.01305314],"category_scores_gemma":[0.002527047,0.0003978441,0.0008483568,0.0007270426,0.001905488,0.00349934,0.003102989,0.002275863,0.001638581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008177722,"about_ca_system_score_gemma":0.0008261506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001318096,"about_ca_topic_score_gemma":0.001876805,"domain_scores_codex":[0.9994948,0.0001083187,0.00002001648,0.0001306148,0.00007574037,0.0001704992],"domain_scores_gemma":[0.9993271,0.0003194853,0.00005711625,0.0001510828,0.00004832009,0.00009692091],"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.0004537319,0.0001023864,0.001452717,0.0002900421,0.00004399601,0.0005324558,0.0007709631,0.006689913,0.007448344,0.9189886,0.01336385,0.04986295],"study_design_scores_gemma":[0.00006747355,0.0000739283,0.0004900435,0.00004041544,0.00004307818,0.0002440224,0.0005026357,0.01293928,0.005004057,0.958042,0.02251753,0.00003555687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4345572,0.0007667464,0.4046145,0.007522349,0.001052845,0.0002732909,0.0006921062,0.001943771,0.1485773],"genre_scores_gemma":[0.8334249,0.0004430857,0.1196324,0.001093704,0.0001814088,0.0001227196,0.0005514659,0.0004760462,0.04407412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01305314,"threshold_uncertainty_score":0.04366714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05662253399805527,"score_gpt":0.3083479634721874,"score_spread":0.2517254294741321,"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."}}