{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","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.002463299,0.001061959,0.001697554,0.003992434,0.00292911,0.003455498,0.002679646,0.002282162,0.01014852],"category_scores_gemma":[0.01703993,0.001120905,0.001311199,0.002862582,0.0114348,0.01480341,0.0053661,0.00858142,0.0008785077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021159,"about_ca_system_score_gemma":0.0005392362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009616136,"about_ca_topic_score_gemma":0.0006738067,"domain_scores_codex":[0.9986143,0.0005192542,0.00006237414,0.0003338846,0.00028473,0.0001854442],"domain_scores_gemma":[0.9785242,0.01601951,0.001266282,0.00192548,0.00106261,0.001202046],"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.00007387633,0.00002441802,0.00031965,0.00008637347,0.00001157198,0.0000647066,0.0004909416,0.001866561,0.0004274831,0.9887293,0.001729444,0.006175642],"study_design_scores_gemma":[0.000007360501,0.000006804728,0.00009353,0.00001127706,0.000002803187,0.00003241927,0.00004053819,0.001194889,0.00005957411,0.9974076,0.001139186,0.000004005729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5770765,0.008713726,0.1599786,0.02433313,0.001341076,0.0001211944,0.000792625,0.0003884543,0.2272547],"genre_scores_gemma":[0.9276596,0.006371717,0.02381886,0.001889243,0.002400758,0.0001476671,0.0006571322,0.0003750751,0.03667999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01014852,"threshold_uncertainty_score":0.03395021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"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."}}