On set colorings of complete bipartite graphs

zbMATH Open1228.05151MaRDI QIDQ3090482FDOQ3090482

Authors Steffen Grüter, Andreas Holtkamp, Michel Surmacs 

Publication date 31 August 2011

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(4)

• Grundy coloring in some subclasses of bipartite graphs and their complements
• Coloring vertices and edges of a graph by nonempty subsets of a set
• On the bichromatic \(k\)-set problem
• New results about set colorings of graphs

This page was built for publication: On set colorings of complete bipartite graphs

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