On minimum degree, leaf number, traceability and Hamiltonicity in graphs
type: Item
instance of: scholarly article
title: On minimum degree, leaf number, traceability and Hamiltonicity in graphs
zbMATH Open document ID: 1357.05073
author: Simon Mukwembi
author: Phillip Mafuta
published in: Discrete Applied Mathematics
publication date: 2017-02-27T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6688900
zbMATH Keywords: minimum degree
zbMATH Keywords: leaf number
zbMATH Keywords: spanning paths and cycles
MaRDI profile type: Publication
full work available at URL: j.dam.2016.12.028
OpenAlex ID: W2581721543
cites work: T. P. Kirkman, Mathematician
cites work: Spanning trees with many leaves and average distance
cites work: Spanning trees with many leaves
cites work: Some Theorems on Abstract Graphs
cites work: Minimal spanning trees with a constraint on the number of leaves
cites work: Q4198056
cites work: Sufficient conditions for a graph to be Hamiltonian
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 traceability
cites work: Minimum Degree, Leaf Number, and Hamiltonicity
cites work: On spanning cycles, paths and trees
cites work: DEGREE DISTANCE AND MINIMUM DEGREE
DOI: 10.1016/J.DAM.2016.12.028
description: scientific article; zbMATH DE number 6688900