A note on the non-colorability threshold of a random graph.
Kaporis, Alexis C., Kirousis, Lefteris M., Stamatiou, Yannis C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Kaporis, Alexis C., Kirousis, Lefteris M., Stamatiou, Yannis C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fountoulakis, Nikolaos, Kang, Ross J., McDiarmid, Colin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Peng, Yuejian, Rödl, Vojtech, Ruciński, Andrzej (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Peter Richter, Emily Leven, Anh Tran, Bryan Ek, Jobby Jacob, Darren A. Narayan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others...
Coja-Oghlan, Amin, Frieze, Alan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity: