Hypergraphs with pendant paths are not chromatically unique

DOI10.7151/DMGT.1699MaRDI QIDQ5405277zbMATH OpenOpenAlexFDO

Authors Ioan Tomescu

Publication date 2 April 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

chromatic polynomialchromatic uniquenesssunflower hypergraphpendant path

Mathematics Subject Classification ID

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

Recommendations

• Some results on chromaticity of quasi-linear paths and cycles
• On the chromaticity of multi-bridge hypergraphs
• On \(H\)-chromatic uniqueness of two linear uniform cycles having some edges in common
• Chromatic polynomials of hypergraphs
• scientific article; zbMATH DE number 1248114

Cites work

• scientific article; zbMATH DE number 833904 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Chromatic coefficients of linear uniform hypergraphs
• Chromatic polynomials of hypergraphs
• Intersection Theorems for Systems of Sets
• On a conjecture of Thomassen concerning subgraphs of large girth
• On chromatic equivalence of graphs
• On finite set-systems whose every intersection is a kernel of a star
• On the chromaticity of multi-bridge hypergraphs
• On the chromaticity of quasi linear hypergraphs
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
• Some results on chromatic polynomials of hypergraphs
• Sunflower hypergraphs are chromatically unique
• The search for chromatically unique graphs

Cited in

(7)

• Problems on chromatic polynomials of hypergraphs
• On the chromaticity of multi-bridge hypergraphs
• Some results on chromaticity of quasi-linear paths and cycles
• Zero-free intervals of chromatic polynomials of hypergraphs
• Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
• Some results on chromaticity of quasilinear hypergraphs
• On \(P\)-unique hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405277)