A generalization of perfect graphs?i-perfect graphs

DOI10.1002/(SICI)1097-0118(199609)23:1%3C87::AID-JGT10%3E3.0.CO;2-HMaRDI QIDQ4892347zbMATH OpenOpenAlexFDO

Authors Leizhen Cai, Derek G. Corneil

Publication date 15 December 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199609)23:1%3C87::aid-jgt10%3E3.0.co;2-h

zbMATH Keywords

\(i\)-chromatic number\(i\)-clique number\(i\)-perfect graphs\(i\)-transversalperfect graphsperfectly \(i\)-transversable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Generalized perfect graphs: Characterizations and inversion
• \(i\gamma(1)\)-perfect graphs
• On clique-perfect and K-perfect graphs
• scientific article; zbMATH DE number 975416
• Distance perfectness of graphs
• A note onKi-perfect graphs
• On generalized perfect graphs: Bounded degree and bounded edge perfection
• Perfectly contractile graphs
• Perfect graphs
• Essentially perfect and essentially diperfect graphs

Cited in

(12)

• The complexity of some problems related to GRAPH 3-COLORABILITY
• On the disc-structure of perfect graphs. I: The co-paw-structure
• Stable-\(\Pi\) partitions of graphs
• scientific article; zbMATH DE number 5844229 (Why is no real title available?)
• Ki-covers. II.Ki-perfect graphs
• A note onKi-perfect graphs
• Distance perfectness of graphs
• Padmakar-Ivan Index of Some Types of Perfect Graphs
• Recognizing Graphs Close to Bipartite Graphs
• I-graphs and the corresponding configurations
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
• On generalized perfect graphs: Bounded degree and bounded edge perfection

This page was built for publication: A generalization of perfect graphs?i-perfect graphs

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