On kernel-less clique-acyclic orientations of minimally imperfect graphs

DOI10.1016/S0166-218X(01)00226-8zbMath0989.05047OpenAlexW2039866604MaRDI QIDQ5954249

Tadashi Sakuma

Publication date: 22 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00226-8

zbMATH Keywords

perfect graphstrong perfect graph conjectureBerge and Duchet's conjecturefractional kernelimperfect graphskernel solvabilitypartitionable graph

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites Work

• Perfect graphs are kernel solvable
• Almost integral polyhedra related to certain combinatorial optimization problems
• Fractional kernels in digraphs
• A characterization of perfect graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On kernel-less clique-acyclic orientations of minimally imperfect graphs