Ear decompositions of matching covered graphs
From MaRDI portal
Publication:1125615
DOI10.1007/s004930050051zbMath0929.05064OpenAlexW2009268323MaRDI QIDQ1125615
U. S. R. Murty, Marcelo H. De Carvalho, Cláudio Leonardo Lucchesi
Publication date: 8 December 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050051
Related Items
On Two Unsolved Problems Concerning Matching Covered Graphs, Computing an evolutionary ordering is hard, Bicritical graphs without removable edges, Removable ears of 1-extendable graphs, The two ear theorem on matching-covered graphs, Thin edges in braces, Equivalence classes in matching covered graphs, Matching covered graphs with three removable classes, Even cycles and perfect matchings in claw-free plane graphs, Ear decomposition and induced even cycles, Removable edges in Halin graphs, Generating simple near‐bipartite bricks, A lower bound on the number of removable ears of 1-extendable graphs, Brace generation, On the number of dissimilar pfaffian orientations of graphs, \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks, Faces of Birkhoff Polytopes, 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, On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
