K₄-free and C₆-free planar matching covered graphs
From MaRDI portal
Publication:2811192
DOI10.1002/JGT.21882zbMATH Open1339.05318OpenAlexW1764061692MaRDI QIDQ2811192FDOQ2811192
Nishad Kothari, U. S. R. Murty
Publication date: 10 June 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21882
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
- Ear-decompositions of matching-covered graphs
- Matching structure and the matching lattice
- 2-Isomorphic Graphs
- Brick decompositions and the matching rank of graphs
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
- How to build a brick
- Generating bricks
- Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
Cited In (7)
- On essentially 4-edge-connected cubic bricks
- Birkhoff--von Neumann Graphs that are PM-Compact
- On Two Unsolved Problems Concerning Matching Covered Graphs
- 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)
