New lower bound for multicolor Ramsey numbers for even cycles.
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Anti-Ramsey numbers for graphs with independent cycles.”
New lower bound for multicolor Ramsey numbers for even cycles.
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Grötzsch theorem for the hypergraph of maximal cliques.
Mohar, Bojan, Škrekovski, Riste (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Ramsey minimal graphs.
Luczak, Tomasz (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs
Oleg V. Borodin, Anna O. Ivanova (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40 [...] +1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
List edge-colorings of series-parallel graphs.
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On hypergraphs of girth five.
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring with no 2-colored 's.
Albertson, Michael O., Chappell, Glenn G., Kierstead, H.A., Kündgen, André, Ramamurthi, Radhika (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On-line Ramsey theory for bounded degree graphs.
Butterfield, Jane, Grauman, Tracy, Kinnersley, William B., Milans, Kevin G., Stocker, Christopher, West, Douglas B. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Partitioning 3-colored complete graphs into three monochromatic cycles.
Gyárfás, András, Ruszinkó, Miklós, Sarközy, Gábor N., Szemerédi, Endre (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge-coloring of a family of regular graphs.
Mohar, Bojan, Pisanski, Tomaz (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: