Tutte type theorems for graphs having a perfect internal matching

DOI10.1016/J.IPL.2004.05.016MaRDI QIDQ2390326zbMATH OpenOpenAlexFDO

Authors Miklós Bartha, Miklós Krész

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.05.016

zbMATH Keywords

combinatorial problemsfactor-critical graphsgraph matchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Splitters and barriers in open graphs having a perfect internal matching
• A structure theorem for maximum internal matchings in graphs
• Structuring the elementary components of graphs having a perfect internal matching.
• A Simple Criterion for a Graph to have a Perfect Matching
• scientific article; zbMATH DE number 1161292

Cites work

• scientific article; zbMATH DE number 846955 (Why is no real title available?)
• A structure theorem for maximum internal matchings in graphs
• Matching theory
• Soliton automata
• Structuring the elementary components of graphs having a perfect internal matching.

Cited in

(8)

• Equistarable bipartite graphs
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Splitters and barriers in open graphs having a perfect internal matching
• A structure theorem for maximum internal matchings in graphs
• A characterization of claw-free CIS graphs and new results on the order of CIS graphs
• On the König deficiency of zero-reducible graphs
• Soliton automata with constant external edges
• scientific article; zbMATH DE number 846955 (Why is no real title available?)

This page was built for publication: Tutte type theorems for graphs having a perfect internal matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390326)