The number of Gallai \(k\)-colorings of complete graphs
From MaRDI portal
Publication:777474
DOI10.1016/j.jctb.2019.12.004zbMath1443.05060arXiv1812.10465OpenAlexW2998345723MaRDI QIDQ777474
Jie Han, Josefran de Oliveira Bastos, Fabrício Siqueira Benevides
Publication date: 7 July 2020
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10465
Related Items (10)
Integer colorings with no rainbow 3-term arithmetic progression ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Complete edge-colored permutation graphs ⋮ Counting orientations of graphs with no strongly connected tournaments ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ Extremal problems and results related to Gallai-colorings ⋮ Distribution of colors in Gallai colorings ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ Remarks on the distribution of colors in Gallai colorings
Cites Work
- Unnamed Item
- Gallai-Ramsey numbers for cycles
- Gallai colorings of non-complete graphs
- A note on perfect graphs
- Perfect couples of graphs
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)
- The Erdős-Hajnal conjecture for rainbow triangles
- Counting Gallai 3-colorings of complete graphs
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Edge colorings of complete graphs without tricolored triangles
- A Rainbow Erdös--Rothschild Problem
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- Transitiv orientierbare Graphen
- Graph pairs and their entropies: Modularity problems
This page was built for publication: The number of Gallai \(k\)-colorings of complete graphs
