A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (Q2833252): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: The complexity of rerouting shortest paths / 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: Fast recoloring of sparse 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: 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: Randomly coloring sparse random graphs with fewer colors than the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Grundy and \(b\)-chromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the subset sum reconfiguration problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list edge-colorings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list \(L(2,1)\)-labelings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths between shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean connectivity problem for Horn relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions and maximum degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New proof of brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal reducible bounds for the class of \(k\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667626 / rank
 
Normal rank

Latest revision as of 23:53, 12 July 2024

scientific article
Language Label Description Also known as
English
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
scientific article

    Statements

    A Reconfigurations Analogue of Brooks' Theorem and Its Consequences (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    graph coloring
    0 references
    reconfigurations
    0 references
    Brooks' theorem
    0 references

    Identifiers