A generalization of perfect graphs?i-perfect graphs
From MaRDI portal
Publication:4892347
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199609)23:1<87::AID-JGT10>3.0.CO;2-H" /><87::AID-JGT10>3.0.CO;2-H 10.1002/(SICI)1097-0118(199609)23:1<87::AID-JGT10>3.0.CO;2-HzbMath0857.05037OpenAlexW4249799254MaRDI QIDQ4892347
Leizhen Cai, Derek Gordon Corneil
Publication date: 15 December 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199609)23:1<87::aid-jgt10>3.0.co;2-h
perfect graphs\(i\)-chromatic number\(i\)-clique number\(i\)-perfect graphs\(i\)-transversalperfectly \(i\)-transversable graphs
Related Items (4)
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Stable-\(\Pi\) partitions of graphs ⋮ The complexity of some problems related to GRAPH 3-COLORABILITY ⋮ Recognizing Graphs Close to Bipartite Graphs
This page was built for publication: A generalization of perfect graphs?i-perfect graphs
