On minimum connecting transition sets in graphs
From MaRDI portal
Publication:1627151
DOI10.1007/978-3-030-00256-5_4OpenAlexW2883668902MaRDI QIDQ1627151FDOQ1627151
Authors: Thomas Bellitto, Benjamin Bergougnoux 
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1807.08463
Recommendations
- An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
- Trees in graphs with conflict edges or forbidden transitions
- Finding paths in graphs avoiding forbidden transitions
- Finding paths in grids with forbidden transitions
- Two-factors in orientated graphs with forbidden transitions
Cited In (12)
- Trails in arc-colored digraphs avoiding forbidden transitions
- Trees in graphs with conflict edges or forbidden transitions
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
- Title not available (Why is that?)
- Introduction to routing problems with mandatory transitions
- Title not available (Why is that?)
- Proper‐walk connection number of graphs
- Finding paths in graphs avoiding forbidden transitions
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
- The Minset-Poset Approach to Representations of Graph Connectivity
- On Minimum Connecting Transition Sets in Graphs
This page was built for publication: On minimum connecting transition sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1627151)
