scientific article; zbMATH DE number 1256776
From MaRDI portal
Publication:4228512
zbMath0917.05030MaRDI QIDQ4228512
Robin Thomas, Daniel P. Sanders, Neil Robertson, P. D. Seymour
Publication date: 18 May 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (30)
Graph separators: A parameterized view ⋮ Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation ⋮ Unnamed Item ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ Complexity of the improper twin edge coloring of graphs ⋮ Coloring Eulerian triangulations of the Klein bottle ⋮ Solving Matching Problems Efficiently in Bipartite Graphs ⋮ Ugly mathematics: why do mathematicians dislike computer-assisted proofs? ⋮ Solving combinatorial optimisation problems using oscillator based Ising machines ⋮ Disjoint total dominating sets in near‐triangulations ⋮ Local 7-coloring for planar subgraphs of unit disk graphs ⋮ Maximal strip recovery problem with gaps: hardness and approximation algorithms ⋮ A Markov chain on the solution space of edge colorings of bipartite graphs ⋮ Fast 3-coloring triangle-free planar graphs ⋮ Maximum face-constrained coloring of plane graphs ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem ⋮ Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks ⋮ New linear-time algorithms for edge-coloring planar graphs ⋮ Acyclically 3-colorable planar graphs ⋮ Improper coloring of unit disk graphs ⋮ On Injective Colourings of Chordal Graphs ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces ⋮ Unnamed Item ⋮ On problems without polynomial kernels ⋮ Contracting a Planar Graph Efficiently ⋮ Planar 3-SAT with a clause/variable cycle ⋮ Integer plane multiflow maximisation: one-quarter-approximation and gaps
This page was built for publication:
