The number of Gallai \(k\)-colorings of complete graphs (Q777474): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Typical Structure of Gallai Colorings and Their Extremal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Gallai 3-colorings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of graphs avoiding complete graphs with a prescribed coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai-Ramsey numbers of odd cycles and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Hajnal conjecture for rainbow triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai-Ramsey numbers for cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai colorings of non-complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with a large number of edge-colorings avoiding a rainbow triangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rainbow Erdös--Rothschild Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph pairs and their entropies: Modularity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect couples of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs / rank
 
Normal rank

Latest revision as of 01:09, 23 July 2024

scientific article
Language Label Description Also known as
English
The number of Gallai \(k\)-colorings of complete graphs
scientific article

    Statements

    The number of Gallai \(k\)-colorings of complete graphs (English)
    0 references
    7 July 2020
    0 references
    Gallai colorings
    0 references
    rainbow triangles
    0 references
    complete graphs
    0 references
    counting
    0 references

    Identifiers