{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001624534,0.0001622385,0.0002282862,0.0004586875,0.0003483647,0.0001225188,0.003059357,0.00004786124,0.00007624166],"category_scores_gemma":[0.000223447,0.0001213016,0.00007324518,0.002679757,0.003730027,0.001293514,0.001259952,0.0002087792,0.00002068967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004370264,"about_ca_system_score_gemma":0.0001299225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005694942,"about_ca_topic_score_gemma":0.000001091655,"domain_scores_codex":[0.9974502,0.0001308885,0.0003295489,0.0006569911,0.0007925125,0.0006398743],"domain_scores_gemma":[0.9981773,0.0003663064,0.0001100967,0.0008483933,0.0002497199,0.0002482105],"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.00006652156,0.00005263541,0.0002406087,0.00001348279,0.000005874138,0.00001497957,0.001461937,0.00003640546,0.002765754,0.9718222,0.00000185268,0.02351775],"study_design_scores_gemma":[0.0003151284,0.0006575201,0.002816296,0.00006139417,0.000006011591,0.00006970624,0.00005234807,0.1238206,0.0931281,0.77881,0.00001299682,0.0002498764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2098098,0.00001588797,0.7868361,0.00004254031,0.0004058164,0.0001415707,5.975178e-7,0.0001246425,0.002623027],"genre_scores_gemma":[0.7333655,0.00000463985,0.266545,0.00003949283,0.00002519671,0.000007384981,7.194637e-8,0.000005603847,0.00000712719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5235556,"threshold_uncertainty_score":0.9989812,"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."}}