Removable Edges in Claw-Free Bricks

DOI10.1007/S00373-024-02769-6MaRDI QIDQ6489354zbMATH OpenFDO

Authors Xiaoxia Wu, Fuliang Lu, Lianzhu Zhang

Publication date 21 April 2024

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

Full work available at URL https://doi.org/10.1007/S00373-024-02769-6

Mathematics Subject Classification ID

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

Recommendations

• Removable edges in near-bipartite bricks
• A note on removable edges in near-bricks
• Bicritical graphs without removable edges

Cites work

• A generalization of Little's theorem on Pfaffian orientations
• Bicritical graphs without removable edges
• Brick decompositions and the matching rank of graphs
• Ear decompositions of matching covered graphs
• Ear-decompositions of matching-covered graphs
• Extending matchings in claw-free graphs
• Graph theory
• Matching theory
• Minimal bricks
• 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
• On essentially 4-edge-connected cubic bricks
• Two results on matching extensions with prescribed and proscribed edge sets

Cited in

(4)

• Removable edges in Halin graphs
• A note on removable edges in near-bricks
• Removable edges in near-bipartite bricks
• Thin edges in claw-free bricks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489354)