New results about set colorings of graphs

MaRDI QIDQ612965zbMATH OpenFDO

Authors J. P. Boutin, E. Duchêne, H. Kheddouci, Hamida Seba, Brice Effantin

Publication date 16 December 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/228609, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r173.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

pathsbinary treesLatin squaresedge coloringvertex coloringset coloring problemstrong set coloring

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 6096637
• Strongly set-colorable graphs
• Set colorings of graphs
• Coloring vertices and edges of a graph by nonempty subsets of a set
• On set colorings of complete bipartite graphs

Cited in

(7)

• On set colorings of complete bipartite graphs
• Strongly set-colorable graphs
• Coloring vertices and edges of a graph by nonempty subsets of a set
• Set colorings of graphs
• scientific article; zbMATH DE number 6096637 (Why is no real title available?)
• scientific article; zbMATH DE number 1751952 (Why is no real title available?)
• Set-Valued Graphs: A Survey

This page was built for publication: New results about set colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612965)