On Two Unsolved Problems Concerning Matching Covered Graphs

DOI10.1137/17M1138704zbMath1395.05135arXiv1705.09428OpenAlexW2962892132MaRDI QIDQ3174694

Marcelo H. De Carvalho, U. S. R. Murty, Nishad Kothari, Cláudio Leonardo Lucchesi

Publication date: 18 July 2018

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

Full work available at URL: https://arxiv.org/abs/1705.09428

zbMATH Keywords

perfect matchingsmatching covered graphsconformal minorsprism-based graphssolid graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (7)

Equivalence classes in matching covered graphs ⋮ The cubic vertices of solid minimal bricks ⋮ Birkhoff--von Neumann Graphs that are PM-Compact ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ On essentially 4-edge-connected cubic bricks ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Colouring non-even digraphs

Cites Work

• Unnamed Item
• The perfect matching polytope and solid bricks
• A simpler proof for the two disjoint odd cycles theorem
• Ear-decompositions of matching-covered graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered 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
• How to build a brick
• Generating bricks
• Brace generation
• K ₄ -free and C6¯-free Planar Matching Covered Graphs
• Graphs with independent perfect matchings
• 2-Isomorphic Graphs
• The Factorization of Linear Graphs

This page was built for publication: On Two Unsolved Problems Concerning Matching Covered Graphs