The regular matroids with no 5-wheel minor
From MaRDI portal
Publication:580348
DOI10.1016/0095-8956(89)90051-8zbMath0626.05009OpenAlexW2035851622MaRDI QIDQ580348
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90051-8
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- Decomposition of regular matroids
- A characterization of 3-connected graphs containing a given graph
- Topology of series-parallel networks
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- The Binary Matroids With No 4-Wheel Minor
- On the chromatic number of binary matroids
- On 3-Connected Matroids
- A New Proof of a Theorem of Dirac
- Some Results Concerning the Structure of Graphs
- Connectivity in Matroids
- Lectures on matroids
- A Combinatorial Model for Series-Parallel Networks
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
Related Items (14)
On fixing edges in graph minors ⋮ The structure of graphs with no K3,3 immersion ⋮ The structure of graphs with no W4 immersion ⋮ Combinatorial geometries representable over GF(3) and GF(q). I: The number of points ⋮ Triangles in 3-connected matroids ⋮ Theta rank, levelness, and matroid minors ⋮ Planar graphs with no 6-wheel minor ⋮ A chain theorem for internally 4-connected binary matroids ⋮ A characterization of certain excluded-minor classes of matroids ⋮ On an excluded-minor class of matroids ⋮ Structure and recognition of graphs with no 6-wheel subdivision ⋮ On the structure of 3-connected matroids and graphs ⋮ Internally 4-connected binary matroids without a prism+\(e\) minor ⋮ On regular matroids without certain minors
This page was built for publication: The regular matroids with no 5-wheel minor
