{"id":"W1985638002","doi":"10.1016/j.dam.2007.10.015","title":"Partition into cliques for cubic graphs: Planar case, complexity and approximation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Induced subgraph isomorphism problem; Disjoint sets; Discrete mathematics; Clique-sum; Cograph; Clique; Chordal graph; Induced subgraph; Partition problem; Planar graph; Frequency partition of a graph; Graph; 1-planar graph; Line graph; Graph power","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003936383,0.0001696073,0.0002390477,0.0001281698,0.0004351034,0.00007351182,0.0003055276,0.0000646296,0.000002773937],"category_scores_gemma":[0.00004699187,0.0001514351,0.00005486441,0.0002625685,0.0003035007,0.0003184159,0.0001141887,0.0001110388,0.000008971243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002571223,"about_ca_system_score_gemma":0.00002063802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005539927,"about_ca_topic_score_gemma":0.00001217406,"domain_scores_codex":[0.9987981,0.00002614716,0.0003087728,0.000340124,0.0002383241,0.0002884988],"domain_scores_gemma":[0.9989347,0.0002705761,0.0001377803,0.0004755067,0.00007380953,0.0001075704],"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.00001313327,0.00004817358,0.00001217523,0.0002175162,0.00001469328,0.00002054746,0.00301662,0.000008315727,0.001595701,0.9933739,0.0001314218,0.001547742],"study_design_scores_gemma":[0.0003341678,0.00006487803,0.00002831054,0.00001717089,0.000007933153,0.0003078619,0.0003474909,0.04114321,0.00479114,0.9526495,0.0001213871,0.0001869438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09367829,0.00004789314,0.9039667,0.0001352057,0.00002291844,0.0007675645,0.00001247126,0.0001801499,0.001188815],"genre_scores_gemma":[0.4537371,0.00003017102,0.5458986,0.00004860199,0.00001583719,0.000218716,0.00002196456,0.00001431758,0.00001478056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3600588,"threshold_uncertainty_score":0.6175346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06445379228865139,"score_gpt":0.3174664405960601,"score_spread":0.2530126483074087,"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."}}