C-perfect hypergraphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 846971
- \(C\)-perfect \(K\)-uniform hypergraphs.
- C-cycles in hypergraphs
- Lagrangian-perfect hypergraphs
- Perfect domination sets in Cayley graphs
- On critically perfect graphs
- Cayley hypergraphs and Cayley hypermaps
- Cayley, Marty and Schreier hypergraphs
- About perfection of circular mixed hypergraphs
- Voloshin's conjecture for C-perfect hypertrees
Cites work
- A characterization of perfect graphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- Critical hypergraphs and interesting set-pair systems
- scientific article; zbMATH DE number 3513556 (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?)
- Minimum number of elements of representing a set system of given rank
- Mixed interval hypergraphs
Cited in
(9)- More results on the smallest one-realization of a given set. II
- On perfection and imperfection of one-realizations of a given set
- Exploring the concept of perfection in 3-hypergraphs
- Voloshin's conjecture for C-perfect hypertrees
- About perfection of circular mixed hypergraphs
- Fractional domatic, idomatic, and total domatic numbers of a graph
- \(C\)-perfect \(K\)-uniform hypergraphs.
- Maximum number of colors: C-coloring and related problems
- Attempting perfect hypergraphs
This page was built for publication: C-perfect hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055910)
