Anti-Ramsey numbers for graphs with independent cycles.
Jin, Zemin, Li, Xueliang (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On hypergraphs of girth five.”
Anti-Ramsey numbers for graphs with independent 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:
A lower bound for the number of edges in a graph containing no two cycles of the same length.
Lai, Chunhui (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constructive upper bounds for cycle-saturated graphs of minimum size.
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (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:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic numbers of the strong product of odd cycles
Janez Žerovnik (2006)
Mathematica Slovaca
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:
For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity: