scientific article; zbMATH DE number 1052839

zbMATH Open0907.05022MaRDI QIDQ4351079FDOQ4351079

Authors: Peter Horák 

Publication date: 27 August 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

maximum chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• \(H\)-packing of \(k\)-chromatic graphs
• Title not available (Why is that?)
• On \(k\)-intersection edge colourings
• Title not available (Why is that?)
• The 1-Color Problem and the Brylawski Model
• On the problem of Erdős and Hajnal in the case of list colorings

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)