Tutte sets in graphs I: Maximal tutte sets and D-graphs

DOI10.1002/JGT.20243MaRDI QIDQ3594956zbMATH OpenOpenAlexFDO

Authors E. Schmeichel, D. Bauer, Hajo Broersma, Aurora Morgana

Publication date 9 August 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20243

zbMATH Keywords

\(D\)-graphdeficiencyextreme setindependent setperfect matchingTutte set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Generalizing \(D\)-graphs
• A note on D-graphs
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• Generalizing Tutte's theorem and maximal non-matchable graphs

Cites work

• Maximum matching and a polyhedron with 0,1-vertices
• Splitters and barriers in open graphs having a perfect internal matching

Cited in

(6)

• Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
• Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
• Generalizing \(D\)-graphs
• A note on D-graphs
• On maximum graphs in Tutte polynomial posets
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial

This page was built for publication: Tutte sets in graphs I: Maximal tutte sets and D-graphs

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