Exploring the concept of perfection in 3-hypergraphs

DOI10.1016/J.DAM.2015.03.008zbMATH Open1339.05272OpenAlexW1975597114MaRDI QIDQ299076FDOQ299076

Authors: Amanda Montejano, Deborah Oliveros, Natalia García-Colín 

Publication date: 22 June 2016

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

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

Recommendations

• C-perfect hypergraphs
• Defective colorings on \(k\)-uniform hypergraphs
• \(C\)-perfect \(K\)-uniform hypergraphs.
• scientific article; zbMATH DE number 1933066
• Square critically 3-chromatic hypergraphs

zbMATH Keywords

comparability 3-hypergraphsperfection in 3-hypergraphstransitivity in 3-hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Perfect graphs (05C17)

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• The strong perfect graph theorem
• Mycielski type constructions for hypergraphs associated with fractional colorings
• Transitive oriented 3 hypergraphs of cyclic orders
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Exploring the concept of perfection in 3-hypergraphs

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