Minimum Degree and Dominating Paths
From MaRDI portal
Publication:2958208
DOI10.1002/jgt.22021zbMath1354.05072OpenAlexW2181998690MaRDI QIDQ2958208
Michael S. Jacobson, Ronald J. Gould, Ralph J. Faudree, Douglas B. West
Publication date: 1 February 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22021
Related Items (4)
Path eccentricity of graphs ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Parameterized algorithms for eccentricity shortest path problem ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
Cites Work
- Unnamed Item
- Spanning trees: A survey
- Spanning trees in graphs of minimum degree 4 or 5
- Transversal numbers of uniform hypergraphs
- Neighborhood unions and extremal spanning trees
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Spanning Trees with Many Leaves
- Existence of Δλ-cycles and Δλ-paths
- Connected Domination and Spanning Trees with Many Leaves
- Some Theorems on Abstract Graphs
- On the domination number of a random graph
This page was built for publication: Minimum Degree and Dominating Paths