{"id":"W2048900104","doi":"10.46298/dmtcs.3401","title":"An upper bound for the chromatic number of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Multigraph; Mathematics; Line graph; Discrete mathematics; Graph; Bounded function; Upper and lower bounds; Chromatic polynomial; Chromatic scale; Clique number; Perfect graph; Friendship graph; Bound graph; Critical graph; Graph power","routes":{"ca_aff":true,"ca_fund":true,"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.001135314,0.00118404,0.001027022,0.002196097,0.001971829,0.003195299,0.002966189,0.001851566,0.01878545],"category_scores_gemma":[0.008318988,0.0008146635,0.001023247,0.002186809,0.002679369,0.006995245,0.002542398,0.003915951,0.003208886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980364,"about_ca_system_score_gemma":0.001071303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003884462,"about_ca_topic_score_gemma":0.004880913,"domain_scores_codex":[0.997892,0.0002501184,0.00006208343,0.0007535231,0.0005080071,0.0005343299],"domain_scores_gemma":[0.9887602,0.007337002,0.000607557,0.001943906,0.0007711101,0.0005802618],"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.002522701,0.0006336932,0.01030843,0.0009871166,0.0002144455,0.0008583572,0.001235591,0.1783357,0.1229757,0.4614407,0.03680919,0.1836786],"study_design_scores_gemma":[0.0002098888,0.0004520201,0.005549655,0.0002392698,0.0001569079,0.001094916,0.0002398132,0.5081664,0.04689321,0.3885009,0.04831376,0.0001832497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2489685,0.004535913,0.6302558,0.004838462,0.0003601855,0.0002143477,0.00158647,0.006031132,0.1032091],"genre_scores_gemma":[0.811545,0.001978766,0.1621057,0.001163707,0.0004196732,0.0003483167,0.001599615,0.001006219,0.01983291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01878545,"threshold_uncertainty_score":0.06284356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01896803141561163,"score_gpt":0.3320315070692292,"score_spread":0.3130634756536176,"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."}}