On spanning cycles, paths and trees

DOI10.1016/J.DAM.2013.03.018MaRDI QIDQ2446869zbMATH OpenOpenAlexFDO

Authors 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

centralized terminal networkHamiltonicityleaf numberminimum degreetraceability

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Minimum degree, leaf number and traceability.
• Minimum degree, leaf number, and hamiltonicity
• Spanning paths in graphs
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• Hamiltonicity, minimum degree and leaf number

Cites work

• Degree distance and minimum degree
• Handbook of Graph Theory
• Minimal spanning trees with a constraint on the number of leaves
• Minimum degree, leaf number, and hamiltonicity
• On finding spanning trees with few leaves
• Some Theorems on Abstract Graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning trees with many leaves
• Spanning Trees with Many Leaves
• Spanning trees with many leaves and average distance
• Topological properties of interconnection networks

Cited in

(18)

• Hamiltonicity, minimum degree and leaf number
• Leaf number and Hamiltonian \(C_4\)-free graphs
• Spanning paths in graphs
• Connectivity, traceability and Hamiltonicity
• Minimum degree, leaf number and traceability.
• Leaf-critical and leaf-stable graphs
• A sufficient condition on traceable
• scientific article; zbMATH DE number 5542484 (Why is no real title available?)
• Minimum degree, leaf number, and hamiltonicity
• Bounds on the leaf number in graphs of girth 4 or 5
• Spanning trees in directed circulant graphs and cycle power graphs
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• Spanning paths and cycles in triangle-free graphs
• Radius, leaf number, connected domination number and minimum degree
• Average distance and connected domination
• On a conjecture by Griggs, Kleitman and Shastri
• Estimating the circumference of a graph in terms of its leaf number
• Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces

Describes a project that uses

Uses Software

• Graffiti.pc

This page was built for publication: On spanning cycles, paths and trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446869)