Fast recoloring of sparse graphs (Q896058)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fast recoloring of sparse graphs	scientific article

Statements

scholarly article

0 references

Fast recoloring of sparse graphs (English)

0 references

Nicolas Bousquet

0 references

Guillem Perarnau

0 references

European Journal of Combinatorics

0 references

publication date

11 December 2015

0 references

full work available at URL

https://arxiv.org/abs/1411.6997

0 references

MaRDI profile type

MaRDI publication profile

0 references

Recoloring graphs via tree decompositions

0 references

Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances

0 references

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration

0 references

Mixing 3-colourings in bipartite graphs

0 references

Finding paths between 3-colorings

0 references

0 references

Randomly coloring sparse random graphs with fewer colors than the maximum degree

0 references

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

0 references

Sparsity. Graphs, structures, and algorithms

0 references

Reconfiguration of dominating sets

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1016/J.EJC.2015.08.001

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:896058

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q896058&oldid=38526657"