Circular mixed hypergraphs. II: The upper chromatic number

DOI10.1016/J.DAM.2005.10.012MaRDI QIDQ2495897zbMATH OpenOpenAlexFDO

Authors V. I. Voloshin, Heinz-Juergen Voss

Publication date 30 June 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.10.012

zbMATH Keywords

graph and hypergraph coloringmixed hypergraphsupper chromatic number

Mathematics Subject Classification ID

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

Review text

Authors extend results from Part I [Congr. Numerantium 144, 207--219 (2000; Zbl 0974.05037)] and prove that for every reduced colourable circular mixed hypergraph with order \(n\), upper chromatic number \(\overline\chi\) and sieve number \(s\) holds \(n-s-2\leq \overline\chi\leq n-s+2\).

Recommendations

• Circular and uniquely colorable mixed hypergraphs
• On planar mixed hypergraphs
• About perfection of circular mixed hypergraphs
• Circular and uniquely colorable mixed hypergraphs
• On the Upper Chromatic Numbers of Mixed Interval Hypertrees

Cites work

• About uniquely colorable mixed hypertrees
• Bicoloring Steiner triple systems
• Circular mixed hypergraphs. I: Colorability and unique colorability
• Coloring mixed hypergraphs: theory, algorithms and applications
• scientific article; zbMATH DE number 1696541 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 1933066 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• Mixed hypercacti
• Mixed interval hypergraphs
• Pseudo-chordal mixed hypergraphs
• Strict colouring for classes of Steiner triple systems
• The chromatic spectrum of mixed hypergraphs
• Uncolorable mixed hypergraphs
• Uniquely colorable mixed hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems
• Voloshin's colourings of \(P_{3}\)-designs

Cited in

(5)

• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
• A primal-dual property of the upper chromatic number of mixed hypergraphs
• About perfection of circular mixed hypergraphs
• Generalized extend of one result of the upper chromatical number of the \({\mathcal D}\)-complete uniform mixed hypergraphs

This page was built for publication: Circular mixed hypergraphs. II: The upper chromatic number

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