On minimum connecting transition sets in graphs

DOI10.1007/978-3-030-00256-5_4OpenAlexW2883668902MaRDI QIDQ1627151

Thomas Bellitto, Benjamin Bergougnoux

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1807.08463

Mathematics Subject Classification ID

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

Related Items (3)

Proper‐walk connection number of graphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item

This page was built for publication: On minimum connecting transition sets in graphs