Graph properties and hypergraph colourings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3885934 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3485832 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 3536154 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- An Application of Ramsay's Theorem to a Problem of Erdos and Hajnal
- Colour Classes for r-Graphs
- Colour-critical graphs and hypergraphs
- Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- On Partitioning Planar Graphs
- On Sets of Acquaintances and Strangers at any Party
- On chromatic number of finite set-systems
- On chromatic number of graphs and set-systems
- On generalized graph colorings
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- Perfectly contractile graphs
- The size Ramsey number
Cited in
(6)- On the chromatic index of path decompositions
- The existence of uniquely \(-G\) colourable graphs
- The complexity of generalized graph colorings
- Minimum partition of an independence system into independent sets
- Coloring directed hypergraphs
- scientific article; zbMATH DE number 6786475 (Why is no real title available?)
This page was built for publication: Graph properties and hypergraph colourings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184854)