Set colorings of graphs

DOI10.1016/j.ejc.2008.06.005zbMath1198.05051OpenAlexW2027871959MaRDI QIDQ1024295

S. M. Hegde

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.06.005

zbMATH Keywords

set coloringstrong set coloringplanar strongly set colorable graphsproper set coloringproperly set colorable complete graphsstrongly set colorable complete bipartite graphsstrongly set colorable complete graphsstrongly set colorable trees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

A Note On Set-Indexed Graphs ⋮ Set-Valued Graphs: A Survey ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Monochromatic tree covers and Ramsey numbers for set-coloured graphs ⋮ Coloring vertices and edges of a graph by nonempty subsets of a set ⋮ Strongly set-colorable graphs ⋮ Some results on graceful and sequential powerset-valued graphs ⋮ New classes of set-sequential trees ⋮ Out Set-Magic Digraphs

Cites Work

• Parallel concepts in graph theory
• On the Harmonious Coloring of Graphs
• Vertex-distinguishing edge colorings of graphs

This page was built for publication: Set colorings of graphs