The semi-chromatic number of a graph

DOI10.1134/S1990478913020178MaRDI QIDQ5263799zbMATH OpenOpenAlexFDO

Authors V. G. Vizing

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1990478913020178

zbMATH Keywords

chromatic numberinjective coloringsemi-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Semi-strong chromatic number of a graph
• scientific article; zbMATH DE number 1347013
• The existence of semi-colorings in a graph
• A note on semi-coloring of graphs
• Coloring of complete semigraphs

Cited in

(5)

• The sigma chromatic number of a graph
• More distinct distances under local conditions
• The existence of semi-colorings in a graph
• Semi-strong chromatic number of a graph
• Coloring of complete semigraphs

This page was built for publication: The semi-chromatic number of a graph

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