Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs

MaRDI QIDQ4604353zbMATH OpenFDO

Authors Rafał Witkowski, Janez Žerovnik

Publication date 23 February 2018

zbMATH Keywords

multichromatic numberweighted clique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Simpler multicoloring of triangle-free hexagonal graphs
• On Reed's conjecture about , and
• Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
• An upper bound for the chromatic number of line graphs
• scientific article; zbMATH DE number 4195987

Cited in

(1)

• New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's conjecture

This page was built for publication: Proof of McDiarmid-Reed conjecture for a subclass of hexagonal graphs

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