On sufficient conditions for a graph to be \(k\)-path-coverable, \(k\)-edge-hamiltonian, Hamilton-connected, traceable and \(k^{-}\)-independent
- Resource Type
- Source
- Open Journal of Discrete Applied Mathematics. 3:66-76
- Subject
Physics Combinatorics K-edge Hamiltonian (control theory) - Language
- ISSN
- 2617-9687
2617-9679