Connectivity, traceability and Hamiltonicity
From MaRDI portal
Publication:2153129
DOI10.1007/S44007-021-00014-7zbMATH Open1496.05091OpenAlexW4206676056MaRDI QIDQ2153129FDOQ2153129
Josiah Mushanyu, J. P. Mazorodze, S. Munyira, Phillip Mafuta
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
Recommendations
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Note on Hamilton Circuits
- Some Theorems on Abstract Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient conditions for a graph to be Hamiltonian
- A generalization of Ore's Theorem involving neighborhood unions
- Longest cycles in triangle-free graphs
- On spanning cycles, paths and trees
- Minimal spanning trees with a constraint on the number of leaves
- Minimum degree, leaf number and traceability
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- Combinatorial optimization in communication networks.
- Spanning paths in graphs
- Spanning paths and cycles in triangle-free graphs
- Hamiltonicity, minimum degree and leaf number
- Title not available (Why is that?)
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
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)
