scientific article; zbMATH DE number 1256776
From MaRDI portal
Publication:4228512
Recommendations
Cited in
(54)- On problems without polynomial kernels
- How false is Kempe's proof of the four color theorem? II
- On linear-time algorithms for five-coloring planar graphs
- Heuristic for rapidly four-coloring large planar graphs
- Maximum face-constrained coloring of plane graphs
- Graph separators: A parameterized view
- Coloring Eulerian triangulations of the Klein bottle
- Ugly mathematics: why do mathematicians dislike computer-assisted proofs?
- Fast 3-coloring triangle-free planar graphs
- Integer plane multiflow maximisation: one-quarter-approximation and gaps
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
- Complexity of the improper twin edge coloring of graphs
- Local 7-coloring for planar subgraphs of unit disk graphs
- Maximal strip recovery problem with gaps: hardness and approximation algorithms
- New linear-time algorithms for edge-coloring planar graphs
- A Markov chain on the solution space of edge colorings of bipartite graphs
- Solving matching problems efficiently in bipartite graphs
- Improper coloring of unit disk graphs
- Four colouring the vertices of the triangulation of a polygon containing a hole
- scientific article; zbMATH DE number 5952228 (Why is no real title available?)
- A Linear Algorithm for Colouring Planar Graphs with Five Colours
- An O(N2) algorithm for coloring perfect planar graphs
- Colouring planar graphs
- A new approach to problem of planar graph colorability
- Coloring planar homothets and three-dimensional hypergraphs
- scientific article; zbMATH DE number 4023314 (Why is no real title available?)
- Every Planar Map is Four Colorable
- Polychromatic 4-coloring of cubic bipartite plane graphs
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- Problems and invariants connected with bicliques and multicliques of graphs
- Evader interdiction: algorithms, complexity and collateral damage
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
- Contracting a planar graph efficiently
- Planar 3-SAT with a clause/variable cycle
- Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks
- On Injective Colourings of Chordal Graphs
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- Solving combinatorial optimisation problems using oscillator based Ising machines
- Disjoint total dominating sets in near‐triangulations
- Physical zero-knowledge proofs for Five Cells
- The complexity of growing a graph
- An improved integrality gap for disjoint cycles in planar graphs
- Colouring the 1-skeleton of d-dimensional triangulations
- Geometric covering via extraction theorem
- Acyclically 3-colorable planar graphs
- Approximating maximum integral multiflows on bounded genus graphs
- A simple quadratic kernel for token jumping on surfaces
- Efficient parameterized approximation
- Approximation and parameterized algorithms for covering with disks of two types of radii
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
- A simple algorithm for 4-coloring 3-colorable planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228512)
