Geodesic
New results about set colorings of graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The set coloring problem is a new kind of both vertex and edge coloring of a graph introduced by Suresh Hegde in 2009. Only large bounds have been given on the chromatic number for general graphs. In this paper, we consider the problem on paths and complete binary trees, and show that it can be reduced to the computation of a transversal in a special Latin square, i.e., the XOR table. We then investigate a variation of the problem called strong set coloring, and we provide an exhaustive list of all graphs being strongly set colorable with at most 4 colors.
DOI : 10.37236/445
Classification : 05C15, 05B15
Mots-clés : set coloring problem, vertex coloring, edge coloring, paths, binary trees, Latin squares, strong set coloring 
@article{10_37236_445,
     author = {J. P. Boutin and E. Duch\^ene and B. Effantin and H. Kheddouci and H. Seba},
     title = {New results about set colorings of graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/445},
     zbl = {1204.05045},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/445/}
}
TY  - JOUR
AU  - J. P. Boutin
AU  - E. Duchêne
AU  - B. Effantin
AU  - H. Kheddouci
AU  - H. Seba
TI  - New results about set colorings of graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/445/
DO  - 10.37236/445
ID  - 10_37236_445
ER  - 
%0 Journal Article
%A J. P. Boutin
%A E. Duchêne
%A B. Effantin
%A H. Kheddouci
%A H. Seba
%T New results about set colorings of graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/445/
%R 10.37236/445
%F 10_37236_445
J. P. Boutin; E. Duchêne; B. Effantin; H. Kheddouci; H. Seba. New results about set colorings of graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/445

Cité par Sources :