On Even Triangulations of 2-Connected Embedded Graphs

DOI10.1137/S0097539702408247zbMath1069.05071OpenAlexW1977086868MaRDI QIDQ5317169

Huaming Zhang, Xin He

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702408247

zbMATH Keywords

graph coloringplane graphhigh genus graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (3)

Extension to Even Triangulations ⋮ Extension to 3-Colorable Triangulations ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers

This page was built for publication: On Even Triangulations of 2-Connected Embedded Graphs