Disjoint Odd Cycles in Cubic Solid Bricks

DOI10.1137/18M1185296zbMath1472.05125OpenAlexW2919307380MaRDI QIDQ4627479

Guantao Chen, Xing Feng, Fuliang Lu, Lian Zhu 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 graphstight cutsolid brickseparating cut

Mathematics Subject Classification ID

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

Related Items (1)

Relations between global forcing number and maximum anti-forcing number of a graph

Cites Work

• Unnamed Item
• The perfect matching polytope and solid bricks
• Brick decompositions and the matching rank of graphs
• Matching structure and the matching lattice
• Perfect matchings versus odd cuts
• On tight cuts in matching covered graphs
• On essentially 4-edge-connected cubic bricks
• How to build a brick
• On Two Unsolved Problems Concerning Matching Covered Graphs

This page was built for publication: Disjoint Odd Cycles in Cubic Solid Bricks