Claw-free solid bricks

DOI10.1007/S00373-025-02958-XMaRDI QIDQ6942796zbMATH OpenFDO

Authors Jinqiu Zhou, Xing Feng, Weigen Yan

Publication date 18 August 2025

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

Full work available at URL https://doi.org/10.1007/S00373-025-02958-X

zbMATH Keywords

claw-free graphmatching covered graphsolid bricktight cut

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• Brick decompositions and the matching rank of graphs
• Ear-decompositions of matching-covered graphs
• Graph theory
• How to build a brick
• Matching structure and the matching lattice
• Matching theory
• On tight cuts in matching covered graphs
• On two unsolved problems concerning matching covered graphs
• Perfect matchings versus odd cuts
• Perfect matchings. A theory of matching covered graphs (to appear)
• The perfect matching polytope and solid bricks

This page was built for publication: Claw-free solid bricks

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