{"id":"W2527693017","doi":"10.1002/jgt.20057","title":"Disjoint clique cutsets in graphs without long holes","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Dayton","keywords":"Combinatorics; Mathematics; Complete bipartite graph; Cograph; Split graph; Discrete mathematics; Clique graph; Disjoint sets; Block graph; Vertex (graph theory); Separable space; Clique problem; Clique-sum; Bipartite graph; Chordal graph; Graph; 1-planar graph; Line graph; Graph power","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.0005287422,0.0004504113,0.0005679048,0.001234512,0.001169566,0.001411233,0.0009201737,0.0007780226,0.005809289],"category_scores_gemma":[0.003376399,0.0006943363,0.0005342155,0.001377785,0.001149488,0.002692726,0.001830033,0.0009939872,0.0005699389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009275193,"about_ca_system_score_gemma":0.000707985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003775462,"about_ca_topic_score_gemma":0.004715107,"domain_scores_codex":[0.9992679,0.0001301758,0.00003697139,0.0002061886,0.0002116057,0.0001472671],"domain_scores_gemma":[0.9978416,0.0008909899,0.0003636751,0.0003757767,0.0002809536,0.0002470357],"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.0009941206,0.0002650373,0.004492403,0.0004755778,0.0001231665,0.0008496529,0.001157376,0.1125778,0.0176473,0.6835885,0.01573844,0.1620907],"study_design_scores_gemma":[0.0001520427,0.000110229,0.002201291,0.00006664234,0.00004996195,0.0006689612,0.0006158823,0.2555848,0.008153911,0.7160763,0.01628245,0.00003745284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5365953,0.0004568564,0.4403741,0.0009037239,0.00008308001,0.0003617812,0.001014557,0.0006865429,0.01952414],"genre_scores_gemma":[0.7995394,0.0002570088,0.1897643,0.0002149175,0.00004893152,0.0002067204,0.002080725,0.0001588831,0.007729049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005809289,"threshold_uncertainty_score":0.01943398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01548365946426287,"score_gpt":0.3015029554822439,"score_spread":0.286019296017981,"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."}}