{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003407183,0.0002901387,0.0003888022,0.000190217,0.0006969693,0.000550204,0.00553726,0.00006539706,0.00008151851],"category_scores_gemma":[0.0002773725,0.0001810105,0.0002101276,0.001422858,0.005055673,0.001159762,0.0008750183,0.000238373,0.00004790722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000402164,"about_ca_system_score_gemma":0.0001307023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001023394,"about_ca_topic_score_gemma":8.967056e-7,"domain_scores_codex":[0.9964992,0.0001192215,0.000630231,0.0007160011,0.001199844,0.0008354533],"domain_scores_gemma":[0.9951264,0.001751466,0.0002022432,0.002172666,0.0004424487,0.0003047504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009021808,0.0001658905,0.00002241928,0.00005164837,0.00001491317,9.34207e-7,0.001574793,0.0004056033,0.001023346,0.9847762,0.0000176489,0.01193758],"study_design_scores_gemma":[0.0001604766,0.0001156637,0.00003414716,0.00003218006,0.000009304345,0.00002416236,0.00003799358,0.5109921,0.00291626,0.4854975,0.00004095479,0.0001392939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04025615,0.00004687562,0.9565977,0.001245958,0.0001760244,0.0006643443,0.000008355222,0.0001248378,0.0008797751],"genre_scores_gemma":[0.5466151,0.00000512058,0.4530866,0.0001640852,0.00006632247,0.0000364615,8.799791e-7,0.00001458149,0.00001083589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5105865,"threshold_uncertainty_score":0.9998432,"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."}}