Coloring vertices and edges of a graph by nonempty subsets of a set

DOI10.1016/J.EJC.2010.11.008MaRDI QIDQ2430971zbMATH OpenOpenAlexFDO

Authors Paul Balister, Ervin Győri, R. H. Schelp

Publication date 8 April 2011

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

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

zbMATH Keywords

strongly set colorable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Strongly set-colorable graphs
• Set colorings of graphs
• On set colorings of complete bipartite graphs
• New results about set colorings of graphs
• scientific article; zbMATH DE number 6096637

Cites work

• A note on ternary sequences of strings of 0 and 1
• Set colorings of graphs

Cited in

(10)

• Set colorings of graphs
• New classes of set-sequential trees
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs
• On set colorings of complete bipartite graphs
• A Note On Set-Indexed Graphs
• Set-Valued Graphs: A Survey
• New results about set colorings of graphs
• Finding a perfect matching of \(\mathbb{F}_2^n\) with prescribed differences
• Set-sequential labelings of odd trees
• Finding pairwise disjoint vector pairs in \(\mathbb{F}_2^n\) with a prescribed sequence of differences (extended abstract)

This page was built for publication: Coloring vertices and edges of a graph by nonempty subsets of a set

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