Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
From MaRDI portal
Publication:3966177
DOI10.1016/S0304-0208(08)72455-1zbMath0501.05050OpenAlexW2337570811MaRDI QIDQ3966177
Denis Naddef, William R. Pulleyblank
Publication date: 1982
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)72455-1
Related Items
On Halin subgraphs and supergraphs, \(k\)-cycle resonant graphs, Computing an evolutionary ordering is hard, Matching structure and the matching lattice, Planar \(k\)-cycle resonant graphs with \(k=1,2\), Reducible chains of planar 1-cycle resonant graphs, Halin graphs and the travelling salesman problem, Optimal ear decompositions of matching covered graphs and bases for the matching lattice, On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
