Some properties of chromatic coefficients of linear uniform hypergraphs
From MaRDI portal
Publication:844223
DOI10.1007/S00373-009-0856-6zbMATH Open1186.05088OpenAlexW2092205158MaRDI QIDQ844223FDOQ844223
Authors: Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary
Publication date: 18 January 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-009-0856-6
Recommendations
- Chromatic coefficients of linear uniform hypergraphs
- scientific article; zbMATH DE number 5237267
- A contribution to the chromatic theory of uniform hypergraphs
- On the chromaticity of quasi linear hypergraphs
- Some results on chromaticity of quasilinear hypergraphs
- scientific article; zbMATH DE number 4198041
- Some results on chromatic polynomials of hypergraphs
- On chromaticity of hypergraphs
- scientific article; zbMATH DE number 989238
- Upper bounds on the linear chromatic number of a graph
Cites Work
- Title not available (Why is that?)
- Chromatic polynomials of hypergraphs
- A broken-circuits-theorem for hypergraphs
- On chromaticity of hypergraphs
- Chromatic coefficients of linear uniform hypergraphs
- Coefficients of chromatic polynomials
- Title not available (Why is that?)
- Chromatic polynomials of hypergraphs
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
Cited In (10)
- Title not available (Why is that?)
- Problems on chromatic polynomials of hypergraphs
- Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
- Zero-free intervals of chromatic polynomials of hypergraphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Chromatic polynomials of hypergraphs
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- On chromatic polynomials of hypergraphs
- A Harary-Sachs theorem for hypergraphs
This page was built for publication: Some properties of chromatic coefficients of linear uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844223)