{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487502,0.0002473613,0.0002606859,0.002104212,0.0003006702,0.0002284192,0.000873816,0.00009559473,0.00001865608],"category_scores_gemma":[0.0002728806,0.0002335735,0.0001166623,0.005513709,0.0003019623,0.0007506135,0.0004477109,0.0003453355,0.00004548696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005362235,"about_ca_system_score_gemma":0.00005831733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001640411,"about_ca_topic_score_gemma":0.000004461594,"domain_scores_codex":[0.9972044,0.0001030574,0.0003852338,0.00069517,0.0009483669,0.0006638002],"domain_scores_gemma":[0.997148,0.001718175,0.0001312947,0.0004492708,0.000225603,0.0003276888],"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.0001216685,0.0001776351,0.03602981,0.00007903038,0.0001782804,0.0001697805,0.0005857064,0.03438014,0.0001848016,0.6311395,0.0002991843,0.2966544],"study_design_scores_gemma":[0.00122589,0.0002838095,0.3943202,0.00003516879,0.00001528093,0.0001916967,0.0002032743,0.03402014,0.0004358095,0.5677725,0.000749786,0.0007464034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2236431,0.0005106842,0.774095,0.0002579382,0.0001734039,0.0001724493,0.000009233651,0.0001479995,0.0009902084],"genre_scores_gemma":[0.8356196,0.00001902498,0.1638051,0.0003610163,0.00003484578,0.00000847861,0.0000237424,0.00001788834,0.0001103529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6119765,"threshold_uncertainty_score":0.952485,"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."}}