\(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
From MaRDI portal
Publication:2309225
DOI10.37236/8945zbMath1435.05164arXiv1905.07301MaRDI QIDQ2309225
Fuliang Lu, Xing Feng, Yan Wang
Publication date: 30 March 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.07301
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
Related Items
Cites Work
- Unnamed Item
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- Ear decompositions of matching covered graphs
- On tight cuts in matching covered graphs
- Pólya's permanent problem
- 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
- On essentially 4-edge-connected cubic bricks
- How to build a brick
- Generating bricks
- K 4 -free and C6¯-free Planar Matching Covered Graphs
- Coverings of Bipartite Graphs
- On perfect matchings in matching covered graphs