scientific article; zbMATH DE number 1052839

MaRDI QIDQ4351079zbMATH OpenFDO

Authors Peter Horák

Publication date 27 August 1997

zbMATH Keywords

maximum chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• scientific article; zbMATH DE number 4070935
• scientific article; zbMATH DE number 3251276
• On 3-colorings of \(E(K_ n)\)
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices

Cited in

(6)

• \(H\)-packing of \(k\)-chromatic graphs
• On the problem of Erdős and Hajnal in the case of list colorings
• scientific article; zbMATH DE number 6518587 (Why is no real title available?)
• On k-intersection edge colourings
• The 1-Color Problem and the Brylawski Model
• scientific article; zbMATH DE number 4070935 (Why is no real title available?)

This page was built for publication:

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