Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
From MaRDI portal
Publication:2400967
DOI10.1016/j.ejc.2017.04.010zbMath1369.05172arXiv1211.1868OpenAlexW2126192783WikidataQ114184788 ScholiaQ114184788MaRDI QIDQ2400967
Maryam Verdian-Rizi, Sang-il Oum, Tony Huynh
Publication date: 31 August 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1868
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
On 4-connected 4-regular graphs without even cycle decompositions ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Improper colouring of graphs with no odd clique minor
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of regular matroids
- Signed graphs
- Even circuits in planar graphs
- Weakly bipartite graphs and the max-cut problem
- Addendum to ``A decomposition of the matroids with the max-flow min-cut property
- A decomposition of the matroids with the max-flow min-cut property
- A characterization of weakly bipartite graphs
- Every planar map is four colorable
- On even circuit decompositions of eulerian graphs
- Even cycles in graphs
- (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
This page was built for publication: Even-cycle decompositions of graphs with no odd-\(K_4\)-minor