Edge decompositions of graphs with no large independent sets.
Galvin, F., Hajnal, A., Komjáth, P. (1995)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On chromatic number of product of graphs”
Edge decompositions of graphs with no large independent sets.
Chromatic number of products of graphs
Vladimír Puš (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Ramseyan properties of graphs.
DeLaVina, Ermelinda, Fajtlowicz, Siemion (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-Ramsey classes and dimensions of graphs
Jan Kratochvíl (1995)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this note, we introduce the notion of -Ramsey classes of graphs and we reveal connections to intersection dimensions of graphs.
All Ramsey numbers for connected graphs of order 9.
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On chromatic uniqueness of a family of -homeomorphs.
Catada-Ghimire, S., Roslan, H., Peng, Y.H. (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity: