Contact and intersection representations

DOI10.1007/978-3-540-31843-9_23MaRDI QIDQ5711607zbMATH OpenOpenAlexFDO

Authors Hubert de Fraysseix, P. Ossona de Mendez

Publication date 7 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105810

Mathematics Subject Classification ID

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

Recommendations

• Representations by contact and intersection of segments
• scientific article; zbMATH DE number 739017
• The maximal clique and colourability of curve contact graphs
• Contact graphs of line segments are NP-complete
• Every planar graph is the intersection graph of segments in the plane (extended abstract)

Cited in

(8)

• An intersection graph of straight lines
• 3-colorable planar graphs have an intersection segment representation using 3 slopes
• Drawings of planar graphs with few slopes and segments
• Intersection-link representations of graphs
• Triangle Contact Representations and Duality
• scientific article; zbMATH DE number 1341903 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• Representations by contact and intersection of segments

This page was built for publication: Contact and intersection representations

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