Decompositions into two paths

DOI10.7151/DMGT.1285MaRDI QIDQ5492646zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 16 October 2006

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/647aecd654f5bdc89f062e49f14ba58715f8bc39

zbMATH Keywords

connected multigraphtraceable pairs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposition of multigraphs
• Decompositions of multigraphs into parts with two edges
• A proof of the two-path conjecture
• Edge decompositions of multigraphs into multi-2-paths
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths

Cited in

(7)

• Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• scientific article; zbMATH DE number 4127221 (Why is no real title available?)
• scientific article; zbMATH DE number 2044747 (Why is no real title available?)
• Path decompositions of multigraphs
• About paths with two blocks

This page was built for publication: Decompositions into two paths

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