{"id":"W1418567529","doi":"10.1016/j.dam.2015.09.015","title":"Counting the number of non-equivalent vertex colorings of a graph","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Degree (music); Vertex (graph theory); Discrete mathematics; 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.003000121,0.001322589,0.001865244,0.003675183,0.002497651,0.005333045,0.00571714,0.002821087,0.007723659],"category_scores_gemma":[0.03362653,0.001214623,0.001688815,0.003617849,0.00289131,0.009108307,0.002689723,0.002682613,0.0007154046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107679,"about_ca_system_score_gemma":0.001657125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147294,"about_ca_topic_score_gemma":0.002056391,"domain_scores_codex":[0.9920849,0.001865518,0.0006765795,0.002180765,0.002172229,0.001019989],"domain_scores_gemma":[0.9474923,0.03527634,0.002984955,0.007841891,0.003650442,0.002754114],"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.004601751,0.001419204,0.1185882,0.002287029,0.001481081,0.0014877,0.001750764,0.137297,0.06494072,0.4104199,0.02056273,0.235164],"study_design_scores_gemma":[0.0002868919,0.0003656632,0.01370197,0.0001257521,0.0005372707,0.002564695,0.0007185138,0.3541697,0.02035916,0.5990252,0.008002097,0.0001431639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8196829,0.0006289621,0.1616207,0.001934125,0.0004947281,0.0001545742,0.002103195,0.000930257,0.01245048],"genre_scores_gemma":[0.8641133,0.0004635834,0.1240354,0.000400471,0.0003799568,0.0002150301,0.003541864,0.0004450566,0.006405238],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007723659,"threshold_uncertainty_score":0.0258382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03439792062034031,"score_gpt":0.3151338333837076,"score_spread":0.2807359127633673,"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."}}