Towards obtaining a 3-decomposition from a perfect matching

DOI10.37236/11128OpenAlexW3080684246MaRDI QIDQ2094896

Sven O. Krumke, Oliver Bachtler

Publication date: 8 November 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.09549

zbMATH Keywords

cubic graphsgraph decompositionHoffmann-Ostenhof's conjecture

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Edge decomposition of connected claw-free cubic graphs
• Cubic maximal nontraceable graphs
• Research problems from the BCC22
• Decomposing plane cubic graphs
• Covering planar graphs with forests, one having bounded maximum degree
• Smallest maximally nonhamiltonian graphs
• Fulkerson's conjecture and circuit covers
• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Covering planar graphs with forests
• Decomposition of cubic graphs with a 2-factor consisting of three cycles
• Decompositions of cubic traceable graphs
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Covering Multigraphs by Simple Circuits
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Blocks and the nonorientable genus of graphs
• Decomposing planar cubic graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Additivity of the genus of a graph