The chromatic number of extended odd graphs is four
Marie Sokolová (1987)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “An extremal theorem in the hypercube.”
The chromatic number of extended odd graphs is four
Edge domination in graphs of cubes
Bohdan Zelinka (2002)
Czechoslovak Mathematical Journal
Similarity:
The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the -dimensional cube .
On multicolor Ramsey number of paths versus cycles.
Omidi, Gholam Reza, Raeisi, Ghaffar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Ramsey minimal graphs.
Luczak, Tomasz (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremal problems for -partite and -colorable hypergraphs.
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anti-Ramsey numbers for graphs with independent cycles.
Jin, Zemin, Li, Xueliang (2009)
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: