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 “Edge-disjoint odd cycles in graphs with small chromatic number”
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:
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Borodin, O.V., Ivanova, A.O., Stechkin, B.S. (2007)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On-line Ramsey theory.
Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic chromatic index of a graph with maximum valency three
Jozef Fiamčík (1980)
Archivum Mathematicum
Similarity:
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: