An upper bound for the path number of a graph
From MaRDI portal
Cited in
(16)- Minimal path decomposition of complete bipartite graphs
- Path decompositions and Gallai's conjecture
- Subgraph coverings and edge switchings
- 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 \(2 k\)-regular graphs
- On path decompositions of 2k-regular graphs
- Path and cycle decompositions of dense graphs
- Gallai's conjecture for graphs of girth at least four
- Graph theory (algorithmic, algebraic, and metric problems)
- Gallai's conjecture on path decompositions
- The problem of path decomposition for graphs with treewidth at most 4
- Path decompositions of Eulerian graphs
- Gallai's conjecture and the path number of odd semi-cliques
- Walks, partitions, and normal ordering
This page was built for publication: An upper bound for the path number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187862)
