Chromatic numbers of layered graphs with a bounded maximal clique

DOI10.1007/S10958-011-0610-5MaRDI QIDQ2256701zbMATH OpenOpenAlexFDO

Authors S. L. Berlov

Publication date 20 February 2015

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-011-0610-5

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• A strengthening of Brooks' theorem
• scientific article; zbMATH DE number 3719178 (Why is no real title available?)
• scientific article; zbMATH DE number 3306567 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Inequalities for the chromatic numbers of graphs
• On the Strong Chromatic Number
• Some remarks on the theory of graphs
• The strong chromatic number of a graph

Cited in

(1)

• Chromatic number versus chromatic number in graphs with bounded clique number

This page was built for publication: Chromatic numbers of layered graphs with a bounded maximal clique

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