On minimum connecting transition sets in graphs

DOI10.1007/978-3-030-00256-5_4MaRDI QIDQ1627151zbMATH OpenOpenAlexFDO

Authors 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)

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)

• Trees in graphs with conflict edges or forbidden transitions
• scientific article; zbMATH DE number 841575 (Why is no real title available?)
• Proper‐walk connection number of graphs
• An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
• The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
• Introduction to routing problems with mandatory transitions
• The Minset-Poset Approach to Representations of Graph Connectivity
• scientific article; zbMATH DE number 7765417 (Why is no real title available?)
• Finding paths in graphs avoiding forbidden transitions
• Trails in arc-colored digraphs avoiding forbidden transitions
• 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)