Optimal ear decompositions of matching covered graphs and bases for the matching lattice
DOI10.1006/JCTB.2001.2090zbMATH Open1024.05071OpenAlexW1964864950MaRDI QIDQ1850602FDOQ1850602
Authors: U. S. R. Murty, Marcelo H. de Carvalho, Cláudio L. Lucchesi 
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bebd9f5240450a31cdaed7c75fde6e75c8723854
Recommendations
- scientific article; zbMATH DE number 898016
- Vector spaces and the Petersen graph
- scientific article; zbMATH DE number 1944136
- Ear decompositions of matching covered graphs
- scientific article; zbMATH DE number 1342146
- On generalizations of matching-covered graphs
- The two ear theorem on matching-covered graphs
- Ear decomposition and induced even cycles
- Ear decompositions in combed graphs
- An O ( VE ) algorithm for ear decompositions of matching-covered graphs
perfect matchingPetersen graphear decompositionbrickmatching covered graphbicritical graphmatching lattice
Cites Work
- Title not available (Why is that?)
- Matching theory
- Ear decompositions of matching covered graphs
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Matching structure and the matching lattice
- Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
- Brick decompositions and the matching rank of graphs
- Rank of maximum matchings in a graph
- On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
- The two ear theorem on matching-covered graphs
- Perfect matchings versus odd cuts
Cited In (16)
- A characterization of nonfeasible sets in matching covered graphs
- Nice pairs of odd cycles in fullerene graphs
- On essentially 4-edge-connected cubic bricks
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- An O ( VE ) algorithm for ear decompositions of matching-covered graphs
- Ear decomposition and induced even cycles
- How to build a brick
- A generalization of Little's theorem on Pfaffian orientations
- Some snarks are worse than others
- Generating simple near‐bipartite bricks
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- On generalizations of matching-covered graphs
- Even cycles and perfect matchings in claw-free plane graphs
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions
- Faces of Birkhoff Polytopes
- On the number of dissimilar pfaffian orientations of graphs
This page was built for publication: Optimal ear decompositions of matching covered graphs and bases for the matching lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850602)
