Back to Search
Start Over
Minimum Degree and Dominating Paths.
- Source :
-
Journal of Graph Theory . Feb2017, Vol. 84 Issue 2, p202-213. 12p. - Publication Year :
- 2017
-
Abstract
- A dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. A result of Broersma from 1988 implies that if G is an n-vertex k-connected graph and [ABSTRACT FROM AUTHOR]
- Subjects :
- *GEOMETRIC vertices
*LOGARITHMIC curves
*LOGARITHMS
*GRAPH theory
*SPANNING trees
Subjects
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 84
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 120231003
- Full Text :
- https://doi.org/10.1002/jgt.22021