Mixed hypergraphs and beyond
From MaRDI portal
Publication:5198021
DOI10.26493/2590-9770.1234.37bzbMath1421.05068OpenAlexW2962423878WikidataQ127546839 ScholiaQ127546839MaRDI QIDQ5198021
Publication date: 2 October 2019
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1234.37b
chromatic spectrumchromatic polynomialmixed hypergraph coloringWORM coloringcoloring of Steiner systemsstably bounded interval hypergraph
Graph polynomials (05C31) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Cites Work
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Maximum number of colors: C-coloring and related problems
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Upper chromatic number of Steiner triple and quadruple systems
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\)
- Strict colorings of Steiner triple and quadruple systems: A survey
- \(F\)-WORM colorings: results for 2-connected graphs
- Worm colorings
- Mixed colorings of hypergraphs
- Upper chromatic number of finite projective planes
- Topics in Chromatic Graph Theory
- Extending bicolorings for Steiner triple systems
- The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)
- Chromatic polynomials of hypergraphs
- Gaps in the chromatic spectrum of face-constrained plane graphs
- Lower and upper chromatic numbers for BSTSs\((2^h-1)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mixed hypergraphs and beyond
