{"id":"W4250290902","doi":"10.1007/s003730050014","title":"Group Connectivity of 3-Edge-Connected Chordal Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Induced subgraph; Connectivity; Bound graph; Vertex connectivity; Wheel graph; Chordal graph; Induced path; Hamiltonian path; Graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Longest path problem","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.0004862702,0.0002132175,0.0003260564,0.0002965087,0.0002255705,0.00007304696,0.0007776399,0.0001048567,0.00004984622],"category_scores_gemma":[0.00005527084,0.0002032814,0.0001258107,0.001950899,0.0002733193,0.0004756411,0.0001774037,0.0002780205,0.000008303357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001695968,"about_ca_system_score_gemma":0.00002935299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003753456,"about_ca_topic_score_gemma":0.000006464685,"domain_scores_codex":[0.9981832,0.0001770197,0.0002765385,0.0005171854,0.0003976455,0.0004483976],"domain_scores_gemma":[0.9985589,0.0003061443,0.00008653245,0.0007001283,0.0001478532,0.0002004647],"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.00003154334,0.0002037188,0.00639351,0.00002387066,0.00002684326,0.00001155052,0.0001838152,0.000002874465,0.000585812,0.9556747,0.00007906364,0.03678267],"study_design_scores_gemma":[0.0009437117,0.0003864594,0.02111081,0.00001601006,0.000007280982,0.00002005158,0.00002579304,0.0008876423,0.001476132,0.9739019,0.0009732808,0.0002508894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865296,0.000856429,0.008719432,0.0001002574,0.0002385521,0.0002372604,0.000007171887,0.0001967269,0.003114567],"genre_scores_gemma":[0.9981459,0.0004722262,0.001150612,0.00005539512,0.000005460825,0.00002200554,0.000002819458,0.00001456657,0.0001310296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03653178,"threshold_uncertainty_score":0.8289573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01179459362828049,"score_gpt":0.2431671078246347,"score_spread":0.2313725141963542,"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."}}