Some Results on Chromaticity of Quasilinear Hypergraphs

DOI10.1007/978-3-0348-0859-0_12zbMath1328.05136OpenAlexW5142409MaRDI QIDQ3462328

Ioan Tomescu

Publication date: 5 January 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0348-0859-0_12

zbMATH Keywords

\(h\)-uniform hypergraphssunflower hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On finite set-systems whose every intersection is a kernel of a star
• The search for chromatically unique graphs
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
• On the chromaticity of multi-bridge hypergraphs
• Chromatic coefficients of linear uniform hypergraphs
• Sunflower hypergraphs are chromatically unique
• On the chromaticity of quasi linear hypergraphs
• Intersection Theorems for Systems of Sets
• Hypergraphs with pendant paths are not chromatically unique
• Chromatic polynomials of hypergraphs

This page was built for publication: Some Results on Chromaticity of Quasilinear Hypergraphs