Spanning paths in graphs
From MaRDI portal
Publication:1727750
DOI10.1016/j.dam.2018.08.001zbMath1405.05088OpenAlexW2889169898MaRDI QIDQ1727750
Sheunesu Munyira, Phillip Mafuta, Simon Mukwembi
Publication date: 20 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.001
Related Items
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, Spanning paths and cycles in triangle-free graphs, Connected Domination
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- New sufficient conditions for cycles in graphs
- Spanning trees with many leaves and average distance
- Traceability of line graphs
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- 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
- Lower bounds of length of longest cycles in graphs involving neighborhood unions
- Long cycles in graphs with prescribed toughness and minimum degree
- Length of longest cycles in a graph whose relative length is at least two
- Sufficient conditions for a graph to be Hamiltonian
- On spanning cycles, paths and trees
- Minimum degree, leaf number and traceability
- Spanning trees with many leaves in cubic graphs
- Note on Hamilton Circuits
- Spanning Trees with Many Leaves
- Extremal problems involving neighborhood unions
- Circumference and girth
- Longest cycles in tough graphs
- DEGREE DISTANCE AND MINIMUM DEGREE
- Minimum Degree, Leaf Number, and Hamiltonicity
- Some Theorems on Abstract Graphs
