Strongly set-colorable graphs

DOI10.1142/S1793830919500071MaRDI QIDQ4621304zbMATH OpenOpenAlexFDO

Authors Kumar Abhishek

Publication date 11 February 2019

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830919500071

zbMATH Keywords

set-coloringstrong set-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On strict strong coloring of graphs
• Strong k-colourings of graphs
• Strong edge colorings of graphs
• Approximation and Online Algorithms
• Set colorings of graphs
• scientific article; zbMATH DE number 6096637
• Strong colourings of hypergraphs
• Set colourings of graphs
• \(d\)-strong total colorings of graphs
• A problem for strong vertex colouring of graphs

Cites work

• Adjacent strong edge coloring of graphs
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3795986 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• New results about set colorings of graphs
• On the Harmonious Coloring of Graphs
• Set colorings of graphs
• Vertex-distinguishing edge colorings of graphs

Cited in

(7)

• Set colorings of graphs
• Coloring vertices and edges of a graph by nonempty subsets of a set
• On set colorings of complete bipartite graphs
• scientific article; zbMATH DE number 6096637 (Why is no real title available?)
• Strong k-colourings of graphs
• A new kind of graph coloring
• New results about set colorings of graphs

This page was built for publication: Strongly set-colorable graphs

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