Graph properties and hypergraph colourings (Q1184854): Difference between revisions

The paper gives new results in hypergraph chromatic theory via a graphic approach. The authors show that Dirac's conjecture (every vertex \(k\)- critical graph, \(k\geq 2\), has a critical edge) fails for hypergraphs.