{"id":"W2730440053","doi":"10.1007/978-3-319-62127-2_9","title":"Dynamic Graph Coloring","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; Fonds De La Recherche Scientifique - FNRS; Carleton University","keywords":"Combinatorics; List coloring; Omega; Graph; Vertex (graph theory); Fractional coloring; Mathematics; Complete coloring; Binary logarithm; Brooks' theorem; Edge coloring; Upper and lower bounds; Graph coloring; Discrete mathematics; Graph power; Physics; Line graph","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.002084726,0.001635321,0.001723776,0.001263773,0.00236763,0.003881483,0.004212162,0.001636594,0.01302542],"category_scores_gemma":[0.01205041,0.0008737926,0.001194776,0.002912589,0.001638721,0.007010799,0.002875195,0.002686874,0.003087253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004265663,"about_ca_system_score_gemma":0.003255464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003743992,"about_ca_topic_score_gemma":0.005960478,"domain_scores_codex":[0.9953193,0.0008487665,0.0001933461,0.001426767,0.001252273,0.0009594808],"domain_scores_gemma":[0.9849726,0.006904765,0.001236208,0.005003078,0.001141959,0.0007413336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001446508,0.0008020806,0.006536887,0.001117985,0.000288188,0.0003660948,0.0006047999,0.3758135,0.03086341,0.2369539,0.03643108,0.3087754],"study_design_scores_gemma":[0.0002321072,0.0004294516,0.002050683,0.00009488703,0.0001875371,0.001128821,0.0003448738,0.713586,0.01812564,0.186733,0.07701262,0.00007434867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1091564,0.002348451,0.8239803,0.0021712,0.0006634899,0.0005041902,0.001423659,0.004964241,0.05478795],"genre_scores_gemma":[0.4481763,0.001697934,0.5193847,0.001239504,0.000409176,0.0005672612,0.002703952,0.002626639,0.0231945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01302542,"threshold_uncertainty_score":0.04357439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02629517287088946,"score_gpt":0.3273733207876667,"score_spread":0.3010781479167772,"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."}}