Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
type: Item
instance of: scholarly article
title: Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
zbMATH Open document ID: 1221.05049
author: Artur Fortuna
author: Zdzisław Skupień
author: Andrzej Żak
published in: Discrete Mathematics
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5565726
zbMATH Keywords: tree
zbMATH Keywords: multigraph
zbMATH Keywords: Hamiltonian decompositions
MaRDI profile type: Publication
full work available at URL: j.disc.2008.03.008
OpenAlex ID: W2032286348
cites work: Q3998644
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Decompositions into two paths
cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs
cites work: Pairs of Adjacent Hamiltonian Circuits with Small Intersection
DOI: 10.1016/J.DISC.2008.03.008
description: scientific article; zbMATH DE number 5565726