Splitter theorems for graph immersions
From MaRDI portal
Combinatorial aspects of matroids and geometric lattices (05B35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)
Cites work
- A Decomposition for Combinatorial Geometries
- A note on the production of matroid minors
- A Reduction Method for Edge-Connectivity in Graphs
- A splitter theorem on 3-connected matroids
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Cyclically five-connected cubic graphs
- Decomposition of regular matroids
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On a theorem of Mader
- On the number of 4-contractible edges in 4-connected graphs
- Splitter theorems for 4-regular graphs
- Splitter Theorems for Cubic Graphs
- Towards a splitter theorem for internally 4-connected binary matroids
- Über eine Eigenschaft der ebenen Komplexe.
This page was built for publication: Splitter theorems for graph immersions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930150)