Set colorings of graphs
From MaRDI portal
Publication:1024295
DOI10.1016/J.EJC.2008.06.005zbMATH Open1198.05051OpenAlexW2027871959MaRDI QIDQ1024295FDOQ1024295
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
Recommendations
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
Cites Work
Cited In (15)
- On multiset colorings of graphs
- Maximal graphical realization of a topology
- Defining sets and uniqueness in graph colorings: A survey
- Set colorings of digraphs
- Set-Valued Graphs: A Survey
- Some results on graceful and sequential powerset-valued graphs
- Out Set-Magic Digraphs
- New classes of set-sequential trees
- A Note On Set-Indexed Graphs
- Coloring vertices and edges of a graph by nonempty subsets of a set
- Title not available (Why is that?)
- Defining sets in vertex colorings of graphs and latin rectangles
- A Vizing-like theorem for union vertex-distinguishing edge coloring
- Strongly set-colorable graphs
- Monochromatic tree covers and Ramsey numbers for set-coloured graphs
This page was built for publication: Set colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024295)