{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","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.001410774,0.0008930001,0.001421986,0.001961228,0.002526923,0.003255722,0.002489525,0.002442102,0.00762007],"category_scores_gemma":[0.0136446,0.0008616167,0.001572386,0.002820742,0.00224472,0.00750021,0.001956005,0.00256513,0.001066841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290816,"about_ca_system_score_gemma":0.001386951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008175837,"about_ca_topic_score_gemma":0.0007889941,"domain_scores_codex":[0.9982336,0.000473759,0.00007951661,0.0005924987,0.0003141978,0.000306564],"domain_scores_gemma":[0.9900908,0.003929526,0.0017597,0.002119179,0.001034608,0.001066131],"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.0009408371,0.0001457047,0.001682048,0.0004134631,0.0001429607,0.0003375848,0.0006069191,0.006907211,0.007368464,0.9365836,0.01155974,0.03331143],"study_design_scores_gemma":[0.0001357736,0.00007695446,0.001782558,0.00004602336,0.0001175355,0.0005426486,0.0002780887,0.01325363,0.003370516,0.9708439,0.009517033,0.00003526244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6173689,0.002058702,0.23384,0.007760092,0.0006183116,0.0003411308,0.003438314,0.0009388633,0.1336357],"genre_scores_gemma":[0.8907214,0.001425098,0.08066807,0.001467643,0.0006875137,0.0003838842,0.002490327,0.0003913534,0.02176459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00762007,"threshold_uncertainty_score":0.02549165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01902994736410249,"score_gpt":0.279226662895465,"score_spread":0.2601967155313625,"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."}}