Bicritical graphs without removable edges

DOI10.1016/j.dam.2022.04.026zbMath1496.05148OpenAlexW4281661185MaRDI QIDQ2166208

Xiumei Wang, Yi-pei Zhang, 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)

Cites Work

• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• Minimal bricks
• On a Family of Planar Bicritical Graphs
• The Factorization of Linear Graphs

This page was built for publication: Bicritical graphs without removable edges