K₄-free and C₆-free planar matching covered graphs
From MaRDI portal
Publication:2811192
Recommendations
- On two unsolved problems concerning matching covered graphs
- Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On essentially 4-edge-connected cubic bricks
- Matching covered graphs with three removable classes
Cites work
- 2-Isomorphic Graphs
- Brick decompositions and the matching rank of graphs
- Ear-decompositions of matching-covered graphs
- Generating bricks
- How to build a brick
- Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
- Matching structure and the matching lattice
- Proof of Toft's conjecture: Every graph containing no fully odd K₄ is 3-colorable
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
Cited in
(9)- On two unsolved problems concerning matching covered graphs
- On essentially 4-edge-connected cubic bricks
- K₄-free planar minimal bricks with the maximum number of edges
- Planar cycle-extendable graphs
- Birkhoff-von Neumann graphs that are PM-compact
- Colouring non-even digraphs
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- Matching extension in prism graphs
- Colouring non-even digraphs
This page was built for publication: \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811192)
