Cover contact graphs

DOI10.20382/jocg.v3i1a6zbMath1404.68079OpenAlexW1867634029MaRDI QIDQ2968088

Auxiliadora Moreno-González, J. Valenzuela, Alexander Wolff, Martin Nöllenburg, María Trinidad Villar, Gregorio Hernández, José Ramón Portillo, M. A. Garrido, Carmen Cortés, Natalia de Castro, Nieves Atienza, Pedro M. Reyes, Clara I. Grima, Alberto Márquez

Publication date: 9 March 2017

Full work available at URL: https://doaj.org/article/cb7a8158ae1d47b0a1d5fdac35fad3c1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Realizability of Graphs as Triangle Cover Contact Graphs ⋮ On triangle cover contact graphs ⋮ Realizability of graphs as triangle cover contact graphs

This page was built for publication: Cover contact graphs