Tutte sets in graphs I: Maximal tutte sets and D-graphs
From MaRDI portal
Publication:3594956
DOI10.1002/jgt.20243zbMath1120.05067OpenAlexW4252703514MaRDI QIDQ3594956
Edward F. Schmeichel, Hajo J. Broersma, Douglas Bauer, 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
Related Items (4)
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets ⋮ Generalized \(D\)-graphs for nonzero roots of the matching polynomial ⋮ Generalizing \(D\)-graphs ⋮ Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers
Cites Work
This page was built for publication: Tutte sets in graphs I: Maximal tutte sets and D-graphs
