Decomposition of 3-connected cubic graphs
From MaRDI portal
Publication:685673
DOI10.1016/0012-365X(93)90365-ZzbMath0791.05079MaRDI QIDQ685673
Jean-Luc Fouquet, Henri Thuillier
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Construction properties of combinatorial deltahedra
- Decomposition of submodular functions
- Deltahedra are realizable as simplicial convex polyhedra
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
- Minimum graphs of specified diameter, connectivity and valence. II
- The minimum-order three-connected cubic graphs with specified diameters
- A Combinatorial Decomposition Theory