On the structure of graphs with low obstacle number

DOI10.1007/s00373-011-1027-0zbMath1235.05099OpenAlexW2083985683MaRDI QIDQ659699

János Pach, Deniz Sarıöz

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

zbMATH Keywords

enumerationsplit graphsforbidden induced subgraphsvisibility graphobstacle numberpolygonal obstacleshereditary graph property

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Grid obstacle representation of graphs, Mutual witness Gabriel drawings of complete bipartite graphs, Mutual witness Gabriel drawings of complete bipartite graphs, Obstructing Visibilities with One Obstacle, Unnamed Item, Outside-obstacle representations with all vertices on the outer face, Drawing graphs using a small number of obstacles, On obstacle numbers, Geodesic obstacle representation of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• Visibility Algorithms in the Plane