Short cycles in random regular graphs.
McKay, Brendan D., Wormald, Nicholas C., Wysocka, Beata (2004)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A note on sparse random graphs and cover graphs.”
Short cycles in random regular graphs.
Few colored cuts or cycles in edge colored graphs
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A density result for random sparse oriented graphs and its relation to a conjecture of Woodall.
Donadelli, Jair, Kohayakawa, Yoshiharu (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Cooper, Colin, Frieze, Alan (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Voltage graphs, group presentations and cages.
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On hypergraphs of girth five.
Lazebnik, Felix, Verstraëte, Jacques (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the resilience of long cycles in random graphs.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu, Marciniszyn, Martin, Steger, Angelika (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The distance between various orientations of a graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity: