Visibility number of directed graphs
DOI10.1137/120864234zbMATH Open1278.05112OpenAlexW2000492297MaRDI QIDQ2870514FDOQ2870514
Authors: Andrew Beveridge, Joan P. Hutchinson, Douglas B. West, Maria 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
Recommendations
- A general notion of visibility graphs
- On the connectivity of visibility graphs
- scientific article; zbMATH DE number 1472168
- Some results on visibility graphs
- A note on visibility graphs
- scientific article; zbMATH DE number 5976585
- COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
- Mutual visibility in graphs
- On \(k\)-visibility graphs
- scientific article; zbMATH DE number 841640
arboricitytournamentsinterval numberSteiner systemsgraph representationsvisibility graphsplanar digraphsouterplanar digraphsbar-visibility
Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Steiner systems in finite geometry (51E10)
Cited In (9)
- The interval number of a planar graph is at most three
- Unit hypercube visibility numbers of trees
- The Bar Visibility Number of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Splits with forbidden subgraphs
- Bar visibility numbers for hypercubes and outerplanar digraphs
- Some new results on bar visibility of digraphs
- On the bar visibility number of complete bipartite graphs
This page was built for publication: Visibility number of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870514)