Minimal non-neighborhood-perfect graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<55::AID-JGT8>3.0.CO;2-L" /><55::AID-JGT8>3.0.CO;2-L 10.1002/(SICI)1097-0118(199601)21:1<55::AID-JGT8>3.0.CO;2-LzbMath0841.05028OpenAlexW2040555446MaRDI QIDQ4862109

András Gyárfás, Frédéric Maffray, Jenő Lehel, Dieter Kratsch

Publication date: 14 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199601)21:1<55::aid-jgt8>3.0.co;2-l

zbMATH Keywords

induced subgraphstrong perfect graph conjectureline graphsoctahedron graphneighborhood-perfectnon-neighborhood-perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Neighbourhood-perfect line graphs ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ Approximating weighted neighborhood independent sets ⋮ On some graph classes related to perfect graphs: a survey

This page was built for publication: Minimal non-neighborhood-perfect graphs