Triangle-Free Planar Graphs and Segment Intersection Graphs

DOI10.7155/JGAA.00043MaRDI QIDQ4540532zbMATH OpenOpenAlexFDO

Authors Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, A. 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)

Cited in

(14)

• Intersections and circuits in sets of line segments
• Planar graphs have 1-string representations
• Drawings of planar graphs with few slopes and segments
• Intersection graphs of L-shapes and segments in the plane
• Optimal space coverage with white convex polygons
• Contact Graphs of Circular Arcs
• Vertex-arboricity of planar graphs without intersecting triangles
• scientific article; zbMATH DE number 6850320 (Why is no real title available?)
• scientific article; zbMATH DE number 7683923 (Why is no real title available?)
• \(B_0\)-VPG representation of AT-free outerplanar graphs
• B0-VPG Representation of AT-free Outerplanar Graphs
• 3-colorable planar graphs have an intersection segment representation using 3 slopes
• Subspace intersection graphs
• Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate

This page was built for publication: Triangle-Free Planar Graphs and Segment Intersection Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540532)