An upper bound for the path number of a graph

DOI10.1002/jgt.3190040207zbMath0403.05056OpenAlexW2153727271MaRDI QIDQ4187862

Alan Donald

Publication date: 1980

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190040207

zbMATH Keywords

Upper BoundPath Number of a Graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (13)

On computing the path number of a graph ⋮ Path decompositions of triangle-free graphs ⋮ An overview of graph covering and partitioning ⋮ On path decompositions of \(2k\)-regular graphs ⋮ On path decompositions of \(2 k\)-regular graphs ⋮ Walks, partitions, and normal ordering ⋮ Gallai's conjecture on path decompositions ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Gallai's Conjecture For Graphs of Girth at Least Four ⋮ Path decompositions and Gallai's conjecture ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Path and cycle decompositions of dense graphs ⋮ Subgraph coverings and edge switchings

This page was built for publication: An upper bound for the path number of a graph