On coverings of random graphs
Miklós Ajtai, J. Komlos, Vojtěch Rödl, Endre Szemerédi (1982)
Commentationes Mathematicae Universitatis Carolinae
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.
Displaying similar documents to “Constrainted graph processes.”
On coverings of random graphs
On Ramsey minimal graphs.
Luczak, Tomasz (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multigraphs (only) satisfy a weak triangle removal lemma.
Shapira, Asaf, Yuster, Raphael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Neighbour-distinguishing edge colourings of random regular graphs.
Greenhill, Catherine, Ruciński, Andrzej (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Few colored cuts or cycles in edge colored graphs
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Drawing a graph in a hypercube.
Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: