On computing the path number of a graph
From MaRDI portal
Publication:2132346
DOI10.1016/j.entcs.2019.08.017OpenAlexW2978116225WikidataQ113317415 ScholiaQ113317415MaRDI QIDQ2132346
Publication date: 27 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.017
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
- NP-completeness of some problems of partitioning and covering in graphs
- Gallai's path decomposition conjecture for graphs of small maximum degree
- Gallai's path decomposition conjecture for triangle-free planar graphs
- Minimal path decomposition of complete bipartite graphs
- Path decompositions and Gallai's conjecture
- Covering the edges of a connected graph by paths
- Gallai's conjecture for disconnected graphs
- On path decompositions of \(2 k\)-regular graphs
- Beautiful conjectures in graph theory
- On the acyclic subgraph polytope
- An upper bound for the path number of a graph
- On path-cycle decompositions of triangle-free graphs
- Gallai's Conjecture For Graphs of Girth at Least Four
- Optimal path and cycle decompositions of dense quasirandom graphs
This page was built for publication: On computing the path number of a graph
