Bicritical graphs without removable edges
From MaRDI portal
Recommendations
Cites work
- Brick decompositions and the matching rank of graphs
- Ear decompositions of matching covered graphs
- Graph theory
- Matching structure and the matching lattice
- Matching theory
- Minimal bricks
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On a Family of Planar Bicritical Graphs
- The Factorization of Linear Graphs
Cited in
(12)- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On essentially 4-edge-connected cubic bricks
- Removable edges in near-bricks
- Cubic vertices of minimal bicritical graphs
- Removable Edges in Claw-Free Bricks
- Removable and forced subgraphs of graphs
- A note on removable edges in near-bricks
- Removable edges in near-bipartite bricks
- An algorithmic framework for optimizing acyclic matching in corona graphs
- Wheel-like bricks and minimal matching covered graphs
- Claw-free minimal matching covered graphs
- Cubic vertices of minimal matching covered graphs
This page was built for publication: Bicritical graphs without removable edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166208)