scientific article; zbMATH DE number 1500690

MaRDI QIDQ4501713zbMATH OpenFDO

Authors Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Marc Noy, A. Márquez

Publication date 4 September 2000

zbMATH Keywords

triangle-free planar graph

Mathematics Subject Classification ID

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

Recommendations

• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Triangle-free geometric intersection graphs with no large independent sets
• scientific article; zbMATH DE number 6850320
• scientific article; zbMATH DE number 739017
• On the triangle graph of a \(K(1,2,3)\)-free maximal planar graph

Cited in

(15)

• Finding geometric representations of apex graphs is NP-hard
• An intersection graph of straight lines
• Not all planar graphs are in PURE-4-DIR
• Intersection graphs of L-shapes and segments in the plane
• On contact graphs of paths on a grid
• Vertex-arboricity of planar graphs without intersecting triangles
• Intersection graphs of halflines and halfplanes
• On Representation of Planar Graphs by Segments
• scientific article; zbMATH DE number 6850320 (Why is no real title available?)
• Triangle-free geometric intersection graphs with no large independent sets
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• On some special classes of contact \(B_0\)-VPG graphs
• Finding geometric representations of apex graphs is \textsf{NP}-hard
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Characterising circular-arc contact \(B_0\)-VPG graphs

This page was built for publication:

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