A structure theorem for maximum internal matchings in graphs
From MaRDI portal
Publication:1183490
DOI10.1016/0020-0190(91)90196-OzbMath0760.05069MaRDI QIDQ1183490
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
bipartite graphTutte's theoremfactor-critical graphGallai-Edmonds structure theoremperfect internal matchings
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Structuring the elementary components of graphs having a perfect internal matching. ⋮ Equistarable bipartite graphs ⋮ A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ Tutte type theorems for graphs having a perfect internal matching ⋮ Soliton automata with constant external edges ⋮ SOLITON AUTOMATA BASED ON TREES
Cites Work