Hypergraphs with pendant paths are not chromatically unique

DOI10.7151/dmgt.1699zbMath1292.05117OpenAlexW2087300899MaRDI QIDQ5405277

Ioan Tomescu

Publication date: 2 April 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1699

zbMATH Keywords

chromatic polynomialchromatic uniquenesssunflower hypergraphpendant path

Mathematics Subject Classification ID

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

Related Items (5)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ On P-unique hypergraphs ⋮ Problems on chromatic polynomials of hypergraphs

Cites Work

• 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
• Some results on chromatic polynomials of hypergraphs
• On the chromaticity of quasi linear hypergraphs
• Intersection Theorems for Systems of Sets
• On chromatic equivalence of graphs
• On a conjecture of Thomassen concerning subgraphs of large girth
• Chromatic polynomials of hypergraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraphs with pendant paths are not chromatically unique