New results about set colorings of graphs

zbMATH Open1204.05045MaRDI QIDQ612965FDOQ612965

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

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

Recommendations

• scientific article
• 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

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)

Cited In (7)

• Title not available (Why is that?)
• Set-Valued Graphs: A Survey
• Set colorings of graphs
• Title not available (Why is that?)
• Coloring vertices and edges of a graph by nonempty subsets of a set
• On set colorings of complete bipartite graphs
• Strongly set-colorable graphs

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)