On the structure of graphs with low obstacle number
DOI10.1007/S00373-011-1027-0zbMATH Open1235.05099OpenAlexW2083985683MaRDI QIDQ659699FDOQ659699
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1027-0
Recommendations
enumerationsplit graphsforbidden induced subgraphsvisibility graphobstacle numberpolygonal obstacleshereditary graph property
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Visibility Algorithms in the Plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Excluding induced subgraphs: quadrilaterals
- Excluding Induced Subgraphs III: A General Asymptotic
- Excluding induced subgraphs. II: Extremal graphs
Cited In (12)
- On obstacle numbers
- A Remark on Elastic Graphs with the Symmetric Cone Obstacle
- Obstructing Visibilities with One Obstacle
- Mutual witness Gabriel drawings of complete bipartite graphs
- Title not available (Why is that?)
- Grid obstacle representation of graphs
- A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles
- Mutual witness Gabriel drawings of complete bipartite graphs
- Drawing graphs using a small number of obstacles
- Outside-obstacle representations with all vertices on the outer face
- On reachability in graphs with obstacles
- Geodesic obstacle representation of graphs
This page was built for publication: On the structure of graphs with low obstacle number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659699)
