Diameter of colorings under Kempe changes (Q5918932): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2020.05.033 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3032033493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Mohar concerning Kempe equivalence of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter of colorings under Kempe changes / rank
 
Normal rank
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: Using contracted solution graphs for solving reconfiguration problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kempe classes and the Hadwiger conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: New proof of brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les 5-colorations d'un graphe planaire forment une classe de commutation unique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness in academic course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Graph Constraint Logic / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2020.05.033 / rank
 
Normal rank

Latest revision as of 10:53, 17 December 2024

scientific article; zbMATH DE number 7242325
Language Label Description Also known as
English
Diameter of colorings under Kempe changes
scientific article; zbMATH DE number 7242325

    Statements

    Diameter of colorings under Kempe changes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 September 2020
    0 references
    combinatorial reconfiguration
    0 references
    graph algorithms
    0 references
    graph coloring
    0 references
    Kempe equivalence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references