Bicritical graphs without removable edges

DOI10.1016/J.DAM.2022.04.026MaRDI QIDQ2166208zbMATH OpenOpenAlexFDO

Authors Yi-pei Zhang, Xiumei Wang, Jinjiang Yuan

Publication date 24 August 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.04.026

zbMATH Keywords

claw-free graphremovable edgebicritical graph2-vertex cut

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• Removable edges in near-bricks
• Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\)
• On essentially 4-edge-connected cubic bricks
• Matching covered graphs with three removable classes

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 Family of Planar Bicritical Graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• The Factorization of Linear Graphs

Cited in

(8)

• On essentially 4-edge-connected cubic bricks
• Removable edges in near-bricks
• Removable and forced subgraphs of graphs
• Removable Edges in Claw-Free Bricks
• Cubic vertices of minimal bicritical graphs
• Removable edges in near-bipartite bricks
• A note on removable edges in near-bricks
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph

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)