Spanning paths and cycles in triangle-free graphs

DOI10.2989/16073606.2019.1654005zbMath1459.05043OpenAlexW2976960899WikidataQ127217122 ScholiaQ127217122MaRDI QIDQ5151426

Josiah Mushanyu, Phillip Mafuta

Publication date: 17 February 2021

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2019.1654005

zbMATH Keywords

minimum degreeHamiltonicitytraceabilityleaf number

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Bounds on the leaf number in graphs of girth 4 or 5 ⋮ Connectivity, traceability and Hamiltonicity ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Average distance and connected domination ⋮ A note on connected domination number and leaf number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• Graph invariants and large cycles: a survey
• Spanning trees: A survey
• Longest cycles in triangle-free graphs
• Minimal spanning trees with a constraint on the number of leaves
• A generalization of Ore's Theorem involving neighborhood unions
• A sufficient condition for graphs with large neighborhood unions to be traceable
• Claw-free graphs---a survey
• Advances on the Hamiltonian problem -- a survey
• Hamiltonicity, minimum degree and leaf number
• Leaf number and Hamiltonian \(C_4\)-free graphs
• Spanning paths in graphs
• Length of longest cycles in a graph whose relative length is at least two
• On spanning cycles, paths and trees
• Minimum degree, leaf number and traceability
• Note on Hamilton Circuits
• Neighborhood unions and hamilton cycles
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Minimum Degree, Leaf Number, and Hamiltonicity
• Some Theorems on Abstract Graphs

This page was built for publication: Spanning paths and cycles in triangle-free graphs