On hypergraph cliques with chromatic number 3
From MaRDI portal
Publication:446285
zbMATH Open1255.05101MaRDI QIDQ446285FDOQ446285
Authors: Danila Cherkashin 
Publication date: 5 September 2012
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)
Cited In (7)
- Clustered 3-colouring graphs of bounded degree
- The Cayley isomorphism property for Cayley maps
- Extremal problems in hypergraph colourings
- On the size of maximal intersecting families
- A general framework for hypergraph coloring
- Independence numbers of Johnson-type graphs
- Coloring cross-intersecting families
This page was built for publication: On hypergraph cliques with chromatic number 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446285)
