Classifying coloring graphs (Q284746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings / 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: Gray code numbers for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kauffman's clock lattice as a graph of perfect matchings: a formula for its height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring sparse random graphs with fewer colors than the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reconfigurations Analogue of Brooks’ Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: γ-graphs of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The canonical coloring graph of trees and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-dominating graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / 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
Property / cites work
 
Property / cites work: Q3424786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for sampling colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Z-transformation graphs of perfect matchings of hexagonal systems / rank
 
Normal rank

Revision as of 23:50, 11 July 2024

scientific article
Language Label Description Also known as
English
Classifying coloring graphs
scientific article

    Statements

    Classifying coloring graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2016
    0 references
    coloring graph
    0 references
    reconfiguration graph
    0 references
    proper colorings
    0 references

    Identifiers