A characterization of horoidal digraphs
From MaRDI portal
Publication:1698749
DOI10.1007/978-3-319-68953-1_2zbMath1485.68180OpenAlexW2762563460MaRDI QIDQ1698749
Publication date: 16 February 2018
Full work available at URL: https://hal.inria.fr/hal-01760640/file/440117_1_En_2_Chapter.pdf
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: A characterization of horoidal digraphs