Decompositions into two paths
From MaRDI portal
Publication:5492646
DOI10.7151/dmgt.1285zbMath1103.05069OpenAlexW1972910267MaRDI QIDQ5492646
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
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