Matching covered graphs with three removable classes
zbMATH Open1300.05249MaRDI QIDQ405203FDOQ405203
Authors: Marcelo H. de Carvalho, C. H. C. Little 
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p13
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- Ear-decompositions of matching-covered graphs
- Matching theory
- Ear decompositions of matching covered graphs
- Graphs with independent perfect matchings
- Matching structure and the matching lattice
- A generalization of Little's theorem on Pfaffian orientations
- Circuit decompositions of join-covered graphs
- A theorem on connected graphs in which every edge belongs to a 1-factor
- The perfect matching polytope and solid bricks
Cited In (7)
- A lower bound on the number of removable ears of 1-extendable graphs
- Bicritical graphs without removable edges
- \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
- Three ways to cover a graph
- Removable and forced subgraphs of graphs
- Even cycles and perfect matchings in claw-free plane graphs
- Removable edges in Halin graphs
This page was built for publication: Matching covered graphs with three removable classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405203)
