Geometric Intersection Graphs: Do Short Cycles Help?

DOI10.1007/978-3-540-73545-8_14zbMath1206.05069OpenAlexW1480764610MaRDI QIDQ3608838

Jan Kratochvíl, Martin Pergel

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Finding geometric representations of apex graphs is NP-hard ⋮ Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard

This page was built for publication: Geometric Intersection Graphs: Do Short Cycles Help?