Finding paths between 3-colorings (Q2998926): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mixing 3-colourings in bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectedness of the graph of vertex-colourings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank | |||
Normal rank | |||
Latest revision as of 00:44, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding paths between 3-colorings |
scientific article |
Statements
Finding paths between 3-colorings (English)
0 references
11 May 2011
0 references
graph coloring
0 references
algorithms
0 references
graph recoloring
0 references
reconfigurations
0 references
0 references
