C-perfect hypergraphs

DOI10.1002/JGT.20444zbMath1209.05159OpenAlexW4251626892WikidataQ59072669 ScholiaQ59072669MaRDI QIDQ3055910

Zsolt Tuza, Csilla Bujtás

Publication date: 10 November 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20444

zbMATH Keywords

vertex coloringmixed hypergraphupper chromatic numbertransversal numberC-perfect hypergraphcircular hypergraph

Mathematics Subject Classification ID

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

Related Items (6)

On perfection and imperfection of one-realizations of a given set ⋮ Attempting perfect hypergraphs ⋮ Maximum number of colors: C-coloring and related problems ⋮ Unnamed Item ⋮ More results on the smallest one-realization of a given set. II ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical hypergraphs and interesting set-pair systems
• Mixed interval hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• Minimum number of elements of representing a set system of given rank
• A characterization of perfect graphs

This page was built for publication: C-perfect hypergraphs