Minimum degree, leaf number and traceability

DOI10.1007/s10587-013-0036-yzbMath1289.05261MaRDI QIDQ2864428

Simon Mukwembi

Publication date: 6 December 2013

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/143331

zbMATH Keywords

Hamiltonicity; traceability; interconnection network; leaf number; Graffiti.pc

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Spanning paths and cycles in triangle-free graphs, 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

• A note on degree conditions for traceability in locally claw-free graphs
• Spanning trees with many leaves and average distance
• Constructing full spanning trees for cubic graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Minimal spanning trees with a constraint on the number of leaves
• A sufficient condition for graphs with large neighborhood unions to be traceable
• Sufficient conditions for a graph to be Hamiltonian
• Spanning Trees with Many Leaves
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Spanning trees with many leaves