Chromatic coefficients of linear uniform hypergraphs

DOI10.1006/jctb.1997.1811zbMath0914.05024OpenAlexW2087505743MaRDI QIDQ1272479

Ioan Tomescu

Publication date: 21 June 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1811

zbMATH Keywords

girthchromatic polynomialchromatically equivalentchromatically uniqueFano configurationlinear uniform hypergraph

Mathematics Subject Classification ID

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

Related Items

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Sunflower hypergraphs are chromatically unique ⋮ Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ On the chromaticity of quasi linear hypergraphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) ⋮ On chromaticity of hypergraphs ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Hypergraphs with pendant paths are not chromatically unique ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Series-parallel chromatic hypergraphs ⋮ Chromatic polynomials of mixed hypercycles ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Chromatic polynomials of hypergraphs ⋮ On the chromaticity of multi-bridge hypergraphs ⋮ On chromatic polynomials of hypergraphs

Cites Work

• The search for chromatically unique graphs
• Coefficients of chromatic polynomials
• On chromatic equivalence of graphs
• An introduction to chromatic polynomials
• Unnamed Item
• Unnamed Item