Sur les R-coloriages minimaux
From MaRDI portal
Publication:1240251
DOI10.1016/0095-8956(77)90067-3zbMath0363.05032OpenAlexW2076651121MaRDI QIDQ1240251
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(77)90067-3
Cites Work
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On a bound of Graham and Spencer for a graph-colouring constant
- N(4, 4; 3)≥13
- Ramsey Theorems for Multiple Copies of Graphs
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- On the maximal triangle-free edge-chromatic graphs in three colors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sur les R-coloriages minimaux