Disjoint odd cycles in cubic solid bricks

DOI10.1137/18M1185296MaRDI QIDQ4627479zbMATH OpenOpenAlexFDO

Authors Guantao Chen, Xing Feng, Fuliang Lu, Lianzhu Zhang

Publication date 11 March 2019

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/18m1185296

zbMATH Keywords

cubic graphmatching covered graphsseparating cutsolid bricktight cut

Mathematics Subject Classification ID

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

Recommendations

• On two unsolved problems concerning matching covered graphs
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On essentially 4-edge-connected cubic bricks
• On extremal nonsolid bricks
• Generating bricks

Cites work

• Brick decompositions and the matching rank of graphs
• Graph theory
• How to build a brick
• Matching structure and the matching lattice
• On essentially 4-edge-connected cubic bricks
• On tight cuts in matching covered graphs
• On two unsolved problems concerning matching covered graphs
• Perfect matchings versus odd cuts
• The perfect matching polytope and solid bricks

Cited in

(3)

• Relations between global forcing number and maximum anti-forcing number of a graph
• On two unsolved problems concerning matching covered graphs
• The cubic vertices of solid minimal bricks

This page was built for publication: Disjoint odd cycles in cubic solid bricks

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