On spanning cycles, paths and trees

DOI10.1016/j.dam.2013.03.018zbMath1287.05080MaRDI QIDQ2446869

Simon Mukwembi

Publication date: 22 April 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.018

zbMATH Keywords

minimum degree; Hamiltonicity; traceability; leaf number; centralized terminal network

Mathematics Subject Classification ID

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

05C07: Vertex degrees

Related Items

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

Uses Software

• Graffiti.pc

Cites Work

• Unnamed Item
• Spanning trees with many leaves and average distance
• Spanning trees in graphs of minimum degree 4 or 5
• Minimal spanning trees with a constraint on the number of leaves
• On finding spanning trees with few leaves
• Spanning Trees with Many Leaves
• Handbook of Graph Theory
• DEGREE DISTANCE AND MINIMUM DEGREE
• Minimum Degree, Leaf Number, and Hamiltonicity
• Some Theorems on Abstract Graphs
• Spanning trees with many leaves