{"id":"W2070606919","doi":"10.1007/s00454-007-1318-7","title":"Graph Treewidth and Geometric Thickness Parameters","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Centre de Recherches Mathématiques","keywords":"Arboricity; Treewidth; Combinatorics; Mathematics; Regular polygon; Conjecture; Upper and lower bounds; Partial k-tree; 1-planar graph; Graph; Crossing number (knot theory); Planar graph; Discrete mathematics; Pathwidth; Geometry; Chordal graph; Mathematical analysis; Line graph","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.001491004,0.0008817192,0.0009109561,0.002415881,0.001103803,0.003896941,0.002651692,0.002100869,0.01155046],"category_scores_gemma":[0.01806127,0.001289562,0.0004993408,0.003701218,0.002708276,0.01498717,0.002793647,0.003059412,0.001166977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303028,"about_ca_system_score_gemma":0.0005680242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007967501,"about_ca_topic_score_gemma":0.001062204,"domain_scores_codex":[0.9990646,0.0002236338,0.00004385484,0.0002811802,0.0002078021,0.0001789229],"domain_scores_gemma":[0.9858293,0.008397751,0.002552571,0.001489858,0.0006137388,0.001116862],"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.0005645897,0.000112869,0.01051839,0.0002242095,0.00005757055,0.0002701755,0.0007402247,0.06902786,0.01123175,0.8582587,0.005887931,0.04310566],"study_design_scores_gemma":[0.00004992752,0.0000652826,0.003859151,0.00008592439,0.00008407424,0.0008667205,0.0005630611,0.1072386,0.00664705,0.8750305,0.005442931,0.00006681837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7035707,0.003632879,0.2417851,0.002972543,0.0001839173,0.00006950011,0.00129749,0.0007723281,0.04571556],"genre_scores_gemma":[0.966036,0.001193268,0.02569509,0.0001748408,0.0001878897,0.00007765041,0.0004410085,0.0004966522,0.00569756],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01155046,"threshold_uncertainty_score":0.03864014,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01927022417299054,"score_gpt":0.2982417351459352,"score_spread":0.2789715109729447,"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."}}