Triangle-Free Planar Graphs and Segment Intersection Graphs

DOI10.7155/JGAA.00043zbMATH Open0999.68163OpenAlexW2036270267MaRDI QIDQ4540532FDOQ4540532

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)

• Drawings of planar graphs with few slopes and segments
• Title not available (Why is that?)
• Intersection graphs of L-shapes and segments in the plane
• Subspace intersection graphs
• Using graph concepts to assess the feasibility of a sequenced air traffic flow with low conflict rate
• Vertex-arboricity of planar graphs without intersecting triangles
• Optimal space coverage with white convex polygons
• Title not available (Why is that?)
• Planar graphs have 1-string representations
• Every collinear set in a planar graph is free
• B0-VPG Representation of AT-free Outerplanar Graphs
• Intersections and circuits in sets of line segments
• Contact Graphs of Circular Arcs
• \(B_0\)-VPG representation of AT-free outerplanar graphs

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)