Decomposition of 3-connected cubic graphs

DOI10.1016/0012-365X(93)90365-ZzbMATH Open0791.05079MaRDI QIDQ685673FDOQ685673

Henri Thuillier, Jean-Luc Fouquet

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositioncubic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A Combinatorial Decomposition Theory
• Title not available (Why is that?)
• Decomposition of submodular functions
• Title not available (Why is that?)
• 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
• Construction properties of combinatorial deltahedra
• Deltahedra are realizable as simplicial convex polyhedra

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
• Edge reductions in cyclically \(k\)-connected cubic graphs
• Decomposition of a 2-connected graph into three connected subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cubic graphs with colouring defect 3

   Recommendations

• Decomposition of 3-connected graphs 👍 👎
• Decomposing planar cubic graphs 👍 👎
• Minimum path decompositions of oriented cubic graphs 👍 👎
• Decomposing plane cubic graphs 👍 👎
• 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)