Triangle-Free Planar Graphs and Segment Intersection Graphs

DOI10.7155/jgaa.00043zbMath0999.68163OpenAlexW2036270267MaRDI QIDQ4540532

Juan Carlos Dana, Natalia de Castro, Francisco Javier Cobos, Alberto Márquez

Publication date: 25 July 2002

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/49573

zbMATH Keywords

triangle-free planar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Contact Graphs of Circular Arcs ⋮ Optimal space coverage with white convex polygons ⋮ Planar graphs have 1-string representations ⋮ Drawings of planar graphs with few slopes and segments ⋮ \(B_0\)-VPG representation of AT-free outerplanar graphs ⋮ B0-VPG Representation of AT-free Outerplanar Graphs ⋮ Subspace intersection graphs ⋮ Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate ⋮ Intersections and circuits in sets of line segments