scientific article; zbMATH DE number 7051179
From MaRDI portal
Publication:4633818
zbMath1423.05065MaRDI QIDQ4633818
Zdeněk Dvořák, Robin Thomas, Daniel Král'
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496784
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 (9)
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Building a maximal independent set for the vertex-coloring problem on planar graphs ⋮ A heuristic for the coloring of planar graphs ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ The disjoint paths problem in quadratic time ⋮ 5‐Coloring reconfiguration of planar graphs with no short odd cycles ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Planar 4-critical graphs with four triangles
This page was built for publication:
