Rooted prism-minors and disjoint cycles containing a specified edge
From MaRDI portal
Publication:6162146
DOI10.37236/10198zbMath1516.05112arXiv2101.04730OpenAlexW4379230903MaRDI QIDQ6162146
Haidong Wu, João Paulo Costalonga, Talmage James Reid
Publication date: 15 June 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04730
Cites Work
- Unnamed Item
- Unnamed Item
- On the Corrádi-Hajnal theorem and a question of Dirac
- On directed versions of the Corrádi-Hajnal corollary
- A decomposition theorem for binary matroids with no prism minor
- A refinement of a result of Corrádi and Hajnal
- A note on nongraphic matroids
- A decomposition theory for matroids. III. Decomposition conditions
- Adjacency in binary matroids
- On minors of non-binary matroids
- Triangles in 3-connected matroids
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- \(l\)-matrices and a characterization of binary matroids
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- Triangle-roundedness in matroids
- Minimum degree conditions for vertex-disjoint even cycles in large graphs
- Projective-planar signed graphs and tangled signed graphs
- The Internally 4-Connected Binary Matroids with No $M(K_{5}\backslash e)$-Minor
- Some Results Concerning the Structure of Graphs
- On the maximal number of independent circuits in a graph
- On the maximal number of independent circuits in a graph
This page was built for publication: Rooted prism-minors and disjoint cycles containing a specified edge