{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002222798,0.001046419,0.00239768,0.002086094,0.002492727,0.007764037,0.004359215,0.003352802,0.01071421],"category_scores_gemma":[0.0261339,0.001212439,0.002434586,0.005363136,0.003208851,0.01471142,0.003854034,0.004815753,0.0007749489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003754415,"about_ca_system_score_gemma":0.002729115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006351158,"about_ca_topic_score_gemma":0.008452965,"domain_scores_codex":[0.9971928,0.0006621417,0.0001194539,0.0006366956,0.000862093,0.0005268573],"domain_scores_gemma":[0.9725422,0.02119495,0.001930652,0.0025875,0.0007477992,0.0009969509],"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.001360157,0.0007124633,0.007613721,0.0008956363,0.0002699682,0.000352801,0.001550205,0.2592211,0.00389893,0.6128908,0.02376616,0.08746807],"study_design_scores_gemma":[0.0001393789,0.00006396195,0.001322102,0.00003631712,0.0000953441,0.0003442089,0.0003782844,0.3873646,0.001068419,0.6057726,0.003381676,0.00003312554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4748898,0.002567094,0.455555,0.01080406,0.0002300674,0.0004459141,0.002456516,0.0007434071,0.05230815],"genre_scores_gemma":[0.8235863,0.001786643,0.1514134,0.0008100019,0.0006357305,0.0003381379,0.003072168,0.0004091711,0.01794845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01071421,"threshold_uncertainty_score":0.0358426,"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."}}