Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory”
Complete and pseudocomplete colourings of a graph
Odd graphs
Bohdan Zelinka (1985)
Archivum Mathematicum
Similarity:
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: