A partition of the non-negative integers, with applications.
Brown, Tom C. (2005)
Integers
Similarity:
Brown, Tom C. (2005)
Integers
Similarity:
Vijay, Sujith (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Éric Sopena, Jiaojiao Wu (2013)
Discussiones Mathematicae Graph Theory
Similarity:
An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w, or e = f, or the edge vw equals e or f. The incidence chromatic number of G is the smallest k for which there exists a mapping from the set of incidences of G to a set of k colors that assigns distinct colors to adjacent incidences. In this paper, we prove that the incidence chromatic number of the toroidal grid Tm,n = Cm2Cn equals...
Jungić, Veselin, Radoičić, Radoš (2003)
Integers
Similarity:
Brown, Tom C. (2000)
Integers
Similarity:
Landman, Bruce, Robertson, Aaron, Culver, Clay (2005)
Integers
Similarity:
Axenovich, Maria, Fon-Der-Flaass, Dmitri (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
G. Mayor (1994)
Aequationes mathematicae
Similarity:
Exoo, Geoffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Manske, Jacob (2008)
Integers
Similarity:
Robert H. Lohman (1974)
Colloquium Mathematicae
Similarity:
Justyna Jarczyk, Janusz Matkowski (2006)
Annales Polonici Mathematici
Similarity:
Under the assumption of twice continuous differentiability of some of the functions involved we determine all the weighted quasi-arithmetic means M,N,K such that K is (M,N)-invariant, that is, K∘(M,N) = K. Some applications to iteration theory and functional equations are presented.
Grytczuk, Jarosław (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Doerr, Benjamin, Srivastav, Anand, Wehr, Petra (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: