Removable Edges in Claw-Free Bricks

DOI10.1007/S00373-024-02769-6MaRDI QIDQ6489354

Lian Zhu Zhang, Xiaoxia Wu, Fuliang Lu

Publication date: 21 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Ear-decompositions of matching-covered graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Ear decompositions of matching covered graphs
• Two results on matching extensions with prescribed and proscribed edge sets
• Extending matchings in claw-free graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• A generalization of Little's theorem on Pfaffian orientations
• Bicritical graphs without removable edges
• On essentially 4-edge-connected cubic bricks
• Minimal bricks

This page was built for publication: Removable Edges in Claw-Free Bricks