Hamiltonicity, minimum degree and leaf number
type: Item
instance of: scholarly article
title: Hamiltonicity, minimum degree and leaf number
zbMATH Open document ID: 1389.05094
author: Tomáš Vetrík
author: Phillip Mafuta
author: Simon Mukwembi
author: S. Munyira
published in: Acta Mathematica Hungarica
publication date: 2017-11-10T00:00:00Z
review text: Let \(G\) be a graph. Then the leaf number of \(G\), denoted by \(L(G)\), is the maximum number of leaves in a spanning tree of \(G\). It is shown that if \(G\) is a connected graph with minimum degree \(\delta (G)\) such that \(\delta (G)\geq \frac{L(G)}{2}+1\) then \(G\) is Hamiltonian.
reviewed by: Peter Horák
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6806134
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: traceability
zbMATH Keywords: minimum degree
zbMATH Keywords: leaf number
MaRDI profile type: Publication
full work available at URL: s10474-017-0716-4
OpenAlex ID: W2607274492
cites work: Hamiltonian Kneser graphs
cites work: Some Theorems on Abstract Graphs
cites work: Hamiltonian cycles in regular graphs of moderate degree
cites work: Minimal spanning trees with a constraint on the number of leaves
cites work: Spanning trees in graphs of minimum degree 4 or 5
cites work: Spanning Trees with Many Leaves
cites work: Minimum Degree, Leaf Number, and Hamiltonicity
cites work: Minimum degree, leaf number and traceability
cites work: On spanning cycles, paths and trees
cites work: Q5628163
cites work: A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
cites work: Leaf-Critical and Leaf-Stable Graphs
DOI: 10.1007/S10474-017-0716-4
description: scientific article; zbMATH DE number 6806134