### Nonrepetitive colorings of graphs -- a survey.

Grytczuk, Jarosław (2007)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Grytczuk, Jarosław (2007)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Curtis, Dawn, Hines, Taylor, Hurlbert, Glenn, Moyer, Tatiana (2009)

Integers

Similarity:

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Mubayi, Dhruv, Talbot, John (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rackham, Tom (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Cui, Qing (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Wood, David R. (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)

Discussiones Mathematicae Graph Theory

Similarity:

For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...

Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Let ${T}_{s}H$ be the graph obtained from a given graph $H$ by subdividing each edge $s$ times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph $H$, there exist graphs $G$ with $O\left(s\right)$ edges that are Ramsey with respect to ${T}_{s}H$.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity: