Pseudo-chordal mixed hypergraphs

DOI10.1016/S0012-365X(98)00295-7zbMath0937.05045MaRDI QIDQ1301719

Vitaly I. Voloshin, Hui Shan Zhou

Publication date: 7 June 2000

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

zbMATH Keywords

chromatic numberchromatic polynomialcoloringmixed hypergraphpseudo-chordal

Mathematics Subject Classification ID

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

Related Items

A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2, Circular mixed hypergraphs. II: The upper chromatic number, \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs

Cites Work

• On rigid circuit graphs
• About the upper chromatic number of a co-hypergraph
• Uniquely colorable mixed hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item