Covering a graph with nontrivial vertex-disjoint paths: existence and optimization

DOI10.1007/978-3-030-00256-5_19OpenAlexW2888864664MaRDI QIDQ1627174

Renzo Gómez, Yoshiko Wakabayashi

Publication date: 22 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-00256-5_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Eulerian walks in temporal graphs ⋮ Nontrivial path covers of graphs: existence, minimization and maximization ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs

This page was built for publication: Covering a graph with nontrivial vertex-disjoint paths: existence and optimization