Set vertex colorings and joins of graphs

DOI10.1007/S10587-009-0064-9zbMATH Open1224.05184OpenAlexW2004190836MaRDI QIDQ3070170FDOQ3070170

Authors: Futaba Okamoto, Craig Rasmussen, Ping Zhang 

Publication date: 2 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/37967

Recommendations

• The set chromatic number of a graph
• Set colorings in perfect graphs.
• Set-vertex coloring of general-Mycielski graph
• On the total set chromatic number of graphs
• Vertex-distinguishing and adjacent vertex-distinguishing total coloring of a class of join graphs

zbMATH Keywords

neighbour-distinguishing colouringneighbourhood colour setset colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Chromatic graph theory
• The set chromatic number of a graph

Cited In (5)

• The set chromatic number of a graph
• On the set chromatic number of the middle graph of extended stars and related tree families
• Set-vertex coloring of general-Mycielski graph
• A note on chromatic blending of colour clusters
• Set colorings in perfect graphs.

This page was built for publication: Set vertex colorings and joins of graphs

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