On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
Kostochka, Alexandr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kostochka, Alexandr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schauz, Uwe (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Albertson, Michael O., Chappell, Glenn G., Kierstead, H.A., Kündgen, André, Ramamurthi, Radhika (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kratochvíl, J. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Caro, Yair (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Oleg V. Borodin, Anna O. Ivanova (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40 [...] +1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Schauz, Uwe (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hajo Broersma, Bert Marchal, Daniel Paulusma, A.N.M. Salman (2009)
Discussiones Mathematicae Graph Theory
Similarity:
We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V→ {1,2,...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial properties of backbone colorings have been studied for various types of backbones in a number of papers....
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jean-Sébastien Sereni, Zelealem B. Yilma (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: