On essentially 4-edge-connected cubic bricks

DOI10.37236/8594zbMath1431.05123arXiv1803.08713OpenAlexW3002049452MaRDI QIDQ2290348

Nishad Kothari, Marcelo H. De Carvalho, Cláudio Leonardo Lucchesi, Charles H. C. Little

Publication date: 27 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (5)

On cycle-nice claw-free graphs ⋮ A characterization of nonfeasible sets in matching covered graphs ⋮ Some snarks are worse than others ⋮ Disjoint Odd Cycles in Cubic Solid Bricks ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks

Uses Software

• SageMath
• House of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The perfect matching polytope and solid bricks
• Minimally non-Pfaffian graphs
• Ear-decompositions of matching-covered graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• House of Graphs: a database of interesting graphs
• Pólya's permanent problem
• A characterization of convertible (0,1)-matrices
• A characterisation of Pfaffian near bipartite graphs
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• 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
• Permanents, Pfaffian orientations, and even directed circuits
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
• How to build a brick
• K ₄ -free and C6¯-free Planar Matching Covered Graphs
• On Two Unsolved Problems Concerning Matching Covered Graphs
• A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
• A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
• The Factorization of Linear Graphs

This page was built for publication: On essentially 4-edge-connected cubic bricks