On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly contractile graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoloring graphs via tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs / 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: The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast recoloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / 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: Mixing 3-colourings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reconfigurations Analogue of Brooks' Theorem and Its Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kempe equivalence of colourings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric coloring theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths between graph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kempe classes and the Hadwiger conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs / 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: Q5815557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank

Latest revision as of 02:50, 18 July 2024

scientific article
Language Label Description Also known as
English
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
scientific article

    Statements

    On a conjecture of Mohar concerning Kempe equivalence of regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    graph colouring
    0 references
    Kempe equivalence
    0 references
    regular graphs
    0 references
    Kempe chain
    0 references
    Wang-Swendsen-Kotecký algorithm
    0 references
    antiferromagnetic Potts model
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers