Decomposing plane cubic graphs

DOI10.1016/J.EJC.2015.08.005MaRDI QIDQ896062zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 11 December 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2015.08.005

zbMATH Keywords

3-connected cubic plane graphs

Mathematics Subject Classification ID

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

Recommendations

• Decomposing planar cubic graphs
• Edge decomposition of connected claw-free cubic graphs
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Decomposition of cubic graphs with a 2-factor consisting of three cycles
• Towards obtaining a 3-decomposition from a perfect matching

Cites work

• scientific article; zbMATH DE number 3756504 (Why is no real title available?)
• scientific article; zbMATH DE number 3492724 (Why is no real title available?)
• scientific article; zbMATH DE number 1156578 (Why is no real title available?)
• 1-Factors and Antifactor Sets
• 2-walks in circuit graphs
• Computing the orientable genus of projective graphs
• Covering planar graphs with forests
• Covering planar graphs with forests, one having bounded maximum degree
• Decomposing a graph into forests
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Edge-partitions of planar graphs and their game coloring numbers
• Fulkerson's conjecture and circuit covers
• Graphs on surfaces
• Graphs with homeomorphically irreducible spanning trees
• NP-completeness and degree restricted spanning trees
• On Hamiltonian Circuits
• On compatible normal odd partitions in cubic graphs
• On normal partitions in cubic graphs
• Research problems from the BCC22
• Trees in Polyhedral Graphs

Cited in

(11)

• Decomposition of cubic graphs with a 2-factor consisting of three cycles
• Decompositions of cubic traceable graphs
• Decomposition of 3-connected cubic graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Decomposing planar cubic graphs
• On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
• Edge decomposition of connected claw-free cubic graphs
• Homeomorphically irreducible spanning trees in hexangulations of surfaces
• Towards obtaining a 3-decomposition from a perfect matching

This page was built for publication: Decomposing plane cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896062)