scientific article; zbMATH DE number 7051288
From MaRDI portal
Publication:4633932
zbMath1423.05064MaRDI QIDQ4633932
Zdeněk Dvořák, Ken-ichi Kawarabayashi, Robin Thomas
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496897
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ Finding disjoint paths in split graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
This page was built for publication:
