On kernel-less clique-acyclic orientations of minimally imperfect graphs (Q5954249): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fractional kernels in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank

Revision as of 22:35, 3 June 2024

scientific article; zbMATH DE number 1699138
Language Label Description Also known as
English
On kernel-less clique-acyclic orientations of minimally imperfect graphs
scientific article; zbMATH DE number 1699138

    Statements

    On kernel-less clique-acyclic orientations of minimally imperfect graphs (English)
    0 references
    0 references
    22 July 2002
    0 references
    0 references
    perfect graph
    0 references
    partitionable graph
    0 references
    imperfect graphs
    0 references
    Berge and Duchet's conjecture
    0 references
    kernel solvability
    0 references
    strong perfect graph conjecture
    0 references
    fractional kernel
    0 references