Visibility Number of Directed Graphs

DOI10.1137/120864234zbMath1278.05112OpenAlexW2000492297MaRDI QIDQ2870514

Douglas B. West, Andrew Beveridge, Joan P. Hutchinson, Maria A. Axenovich

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3898

zbMATH Keywords

Steiner systemsplanar digraphstournamentsinterval numberarboricitygraph representationsvisibility graphsouterplanar digraphsbar-visibility

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Steiner systems in finite geometry (51E10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Bar visibility numbers for hypercubes and outerplanar digraphs ⋮ Unit hypercube visibility numbers of trees ⋮ Splits with forbidden subgraphs ⋮ The interval number of a planar graph is at most three ⋮ On the Bar Visibility Number of Complete Bipartite Graphs