{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002017826,0.0002850487,0.000499894,0.00129768,0.001147591,0.001824055,0.001106336,0.0009549237,0.008578734],"category_scores_gemma":[0.002164603,0.0002519238,0.0002667211,0.001373115,0.001210668,0.002088272,0.001025753,0.0007852385,0.0005324766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005073615,"about_ca_system_score_gemma":0.0003404357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480247,"about_ca_topic_score_gemma":0.001390954,"domain_scores_codex":[0.9997107,0.0000584363,0.00001648828,0.00007608175,0.00006114943,0.00007715203],"domain_scores_gemma":[0.997853,0.000935186,0.0004879594,0.0001948292,0.0002214809,0.000307548],"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.001199018,0.000251388,0.01013498,0.000536042,0.00007434431,0.001155187,0.004060638,0.01516281,0.03132347,0.8709497,0.007617465,0.05753497],"study_design_scores_gemma":[0.0001612052,0.0001113331,0.005413383,0.00005702293,0.00005125028,0.0005183873,0.001625629,0.02289321,0.005381759,0.9559523,0.00780503,0.0000294755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9402027,0.0003084173,0.02319169,0.0006302972,0.00004630097,0.00007931772,0.0005192836,0.0001633479,0.03485869],"genre_scores_gemma":[0.9904274,0.0002344745,0.006083806,0.0001091693,0.00003466585,0.00005855682,0.0004583233,0.00002846159,0.00256505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008578734,"threshold_uncertainty_score":0.02869874,"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."}}