Hardness and Algorithms for Variants of Line Graphs of Directed Graphs

DOI10.1007/978-3-642-45030-3_19zbMath1329.05275OpenAlexW56220973MaRDI QIDQ2872084

Vincent Limouzy, Zhentao Li, Laurent Beaudou, Mourad Baïou

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_19

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Bounds on directed star arboricity in some digraph classes ⋮ On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs

This page was built for publication: Hardness and Algorithms for Variants of Line Graphs of Directed Graphs