Cover contact graphs

DOI10.20382/JOCG.V3I1A6MaRDI QIDQ2968088zbMATH OpenOpenAlexFDO

Authors Nieves Atienza, Natalia de Castro, Carmen Cortés, M. A. Garrido, C. I. Grima, Gregorio Hernández, A. Moreno-González, Martin Nöllenburg, J. R. Portillo, P. Reyes, J. Valenzuela, M. T. Villar, Alexander Wolff, A. Márquez

Publication date 9 March 2017

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

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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)

Recommendations

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

Cited in

(5)

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

This page was built for publication: Cover contact graphs

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