Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Acyclic, star and oriented colourings of graph subdivisions.”
Complete and pseudocomplete colourings of a graph
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Defective choosability of graphs without small minors.
Wood, Rupert G., Woodall, Douglas R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On domatic numbers of graphs
Bohdan Zelinka (1981)
Mathematica Slovaca
Similarity:
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Štefan Znám (1967)
Matematický časopis
Similarity:
On subgraphs induced by transversals in vertex-partitions of graphs.
Axenovich, Maria (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: