On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture

DOI10.1007/S00373-024-02833-1MaRDI QIDQ6632140

Maycon Sambinelli, Yoshiko Wakabayashi, F. Botler, Andrea Jiménez

Publication date: 4 November 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

matchingspanning tree2-decomposition conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Homeomorphically irreducible spanning trees
• Edge decomposition of connected claw-free cubic graphs
• Decomposing plane cubic graphs
• NP-completeness and degree restricted spanning trees
• Decomposing graphs into a spanning tree, an even graph, and a star forest
• Towards obtaining a 3-decomposition from a perfect matching
• Decomposition of cubic graphs with a 2-factor consisting of three cycles
• Decompositions of cubic traceable graphs
• Homeomorphically irreducible spanning trees in hexangulations of surfaces
• Decompositions of graphs into trees, forests, and regular subgraphs
• Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
• Homeomorphically irreducible spanning trees in locally connected graphs
• On homeomorphically irreducible spanning trees in cubic graphs
• Decomposing planar cubic graphs
• Graphs with homeomorphically irreducible spanning trees

This page was built for publication: On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture

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