Minimum Degree, Leaf Number, and Hamiltonicity

DOI10.4169/amer.math.monthly.120.02.115zbMath1264.05076OpenAlexW2606071027WikidataQ58304062 ScholiaQ58304062MaRDI QIDQ4921849

Simon Mukwembi

Publication date: 28 May 2013

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4169/amer.math.monthly.120.02.115

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items

Bounds on the leaf number in graphs of girth 4 or 5, Hamiltonicity, minimum degree and leaf number, Radius, leaf number, connected domination number and minimum degree, Leaf number and Hamiltonian \(C_4\)-free graphs, Average distance and connected domination, On spanning cycles, paths and trees, Spanning paths in graphs, Spanning paths and cycles in triangle-free graphs, On minimum degree, leaf number, traceability and Hamiltonicity in graphs, A note on connected domination number and leaf number

Uses Software

• Graffiti.pc