Connectivity, traceability and Hamiltonicity

DOI10.1007/S44007-021-00014-7MaRDI QIDQ2153129zbMATH OpenOpenAlexFDO

Authors Phillip Mafuta, J. P. Mazorodze, S. Munyira, Josiah Mushanyu

Publication date 1 July 2022

Published in La Matematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s44007-021-00014-7

zbMATH Keywords

pathsminimum degreeconnectivitycyclesorderleaf number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Spanning paths and cycles in triangle-free graphs
• A sufficient condition on traceable
• Improved sufficient conditions for Hamiltonian properties
• scientific article; zbMATH DE number 1208720
• Improved degree conditions for Hamiltonian properties

Cites work

• scientific article; zbMATH DE number 5079858 (Why is no real title available?)
• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3353327 (Why is no real title available?)
• scientific article; zbMATH DE number 970792 (Why is no real title available?)
• A generalization of Ore's Theorem involving neighborhood unions
• Combinatorial optimization in communication networks.
• Hamiltonicity, minimum degree and leaf number
• Leaf number and Hamiltonian \(C_4\)-free graphs
• Long cycles in 2-connected triangle-free graphs
• Longest cycles in triangle-free graphs
• Minimal spanning trees with a constraint on the number of leaves
• Minimum degree, leaf number and traceability.
• Note on Hamilton Circuits
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• On spanning cycles, paths and trees
• Some Theorems on Abstract Graphs
• Spanning paths and cycles in triangle-free graphs
• Spanning paths in graphs
• Sufficient conditions for a graph to be Hamiltonian

Cited in

(4)

• Traceability and Hamiltonicity based on order and minimum degree
• scientific article; zbMATH DE number 3851144 (Why is no real title available?)
• Spanning paths and cycles in triangle-free graphs
• Graphs with forbidden subgraphs and leaf number

This page was built for publication: Connectivity, traceability and Hamiltonicity

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