Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree

DOI10.1016/j.disc.2008.03.008zbMath1221.05049OpenAlexW2032286348MaRDI QIDQ1024512

Artur Fortuna, Zdzisław Skupień, Andrzej Żak

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.008

zbMATH Keywords

treemultigraphHamiltonian decompositions

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Related Items

The number of Hamiltonian decompositions of regular graphs

Cites Work

• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Pairs of Adjacent Hamiltonian Circuits with Small Intersection
• Decompositions into two paths
• Computer Solutions of the Traveling Salesman Problem
• Unnamed Item