Decomposition of 3-connected cubic graphs
From MaRDI portal
Publication:685673
Recommendations
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3966114 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
- Construction properties of combinatorial deltahedra
- Decomposition of submodular functions
- Deltahedra are realizable as simplicial convex polyhedra
- Minimum graphs of specified diameter, connectivity and valence. II
- The minimum-order three-connected cubic graphs with specified diameters
Cited in
(14)- Decomposition of a 2-connected graph into three connected subgraphs
- The spectrum problem for the connected cubic graphs of order 10
- The spectrum problem for 3 of the cubic graphs of order 10
- Minimum path decompositions of oriented cubic graphs
- Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
- Splitting cubic circle graphs
- scientific article; zbMATH DE number 2094440 (Why is no real title available?)
- Cubic graphs with colouring defect 3
- scientific article; zbMATH DE number 2165735 (Why is no real title available?)
- scientific article; zbMATH DE number 3974987 (Why is no real title available?)
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Splitter Theorems for Cubic Graphs
- scientific article; zbMATH DE number 6303054 (Why is no real title available?)
- Decomposition of cubic graphs with cyclic connectivity 5
This page was built for publication: Decomposition of 3-connected cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685673)