Intersection graphs of homothetic polygons

DOI10.1016/j.endm.2008.06.056zbMath1267.05177OpenAlexW2049619877MaRDI QIDQ5301023

Jan Kratochvíl, Martin Pergel

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.056

zbMATH Keywords

intersection graphspolygons

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Homothetic polygons and beyond: maximal cliques in intersection graphs ⋮ Co-bipartite neighborhood edge elimination orderings

Cites Work

• Unit disk graph recognition is NP-hard
• Max-tolerance graphs as intersection graphs
• On Triangle Contact Graphs
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intersection graphs of homothetic polygons