{"id":"W2052262845","doi":"10.1016/j.jctb.2008.03.007","title":"Removable cycles in non-bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Connected component; Mathematics; Disjoint sets; Connectivity; Graph; Complete bipartite graph; Path (computing); Discrete mathematics; Computer science","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.0009058879,0.0008697937,0.001098023,0.003053365,0.002870786,0.003620204,0.002317579,0.002040932,0.007644583],"category_scores_gemma":[0.008244799,0.001393489,0.0009554191,0.002738236,0.002379168,0.004000141,0.001955848,0.002481273,0.0008100743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183684,"about_ca_system_score_gemma":0.0009449566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070249,"about_ca_topic_score_gemma":0.003869117,"domain_scores_codex":[0.9989979,0.0002768219,0.00006322822,0.0002023465,0.0002710615,0.0001887337],"domain_scores_gemma":[0.9925259,0.004401489,0.0009549456,0.0007442144,0.000538661,0.0008346462],"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.0002891877,0.0001803528,0.00227903,0.0002774461,0.00005749685,0.000830644,0.001035093,0.01506165,0.0044867,0.9476674,0.00482147,0.02301358],"study_design_scores_gemma":[0.00005884654,0.00003919554,0.0007286221,0.00007181105,0.00004793415,0.0003774875,0.0003126063,0.04032062,0.001598589,0.9526885,0.003728212,0.00002755209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7680458,0.001759021,0.167196,0.001534583,0.0002940756,0.000224699,0.0006780986,0.0005421774,0.0597254],"genre_scores_gemma":[0.9469958,0.001052649,0.02677357,0.0003995199,0.0002058088,0.0002088671,0.0007879448,0.0002146526,0.02336129],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007644583,"threshold_uncertainty_score":0.02557373,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006866264398241998,"score_gpt":0.1944115973776827,"score_spread":0.1875453329794407,"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."}}