Some new results on bar visibility of digraphs
From MaRDI portal
Publication:6648275
DOI10.1016/J.DAM.2024.09.024MaRDI QIDQ6648275
Jun Ge, Douglas B. West, Yuanrui Feng, Yan Yang
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Recognizing graphs with fixed interval number is NP-complete
- The interval number of a planar graph: Three intervals suffice
- A unified approach to visibility representations of planar graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- The interval number of a planar graph is at most three
- Bar visibility numbers for hypercubes and outerplanar digraphs
- A note on rectilinear and polar visibility graphs
- Graphs on surfaces
- Visibility number of directed graphs
- Topological sorting of large networks
- The Bar Visibility Number of a Graph
- Visibility Algorithms in the Plane
This page was built for publication: Some new results on bar visibility of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648275)
