Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q251511
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hortensia Galeana-Sánchez / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123281560 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on kernel-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On kernel-perfect critical digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of normal fraternally orientable perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of concatenable subtrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Theorems for Solutions of Irreflexive Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank

Latest revision as of 12:58, 22 May 2024

scientific article
Language Label Description Also known as
English
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
scientific article

    Statements

    Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (English)
    0 references
    3 July 1994
    0 references
    0 references
    orientable graphs
    0 references
    chromatic number
    0 references
    colors
    0 references
    clique number
    0 references
    complete subgraph
    0 references
    strong perfect graph conjecture
    0 references
    0 references