Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:45, 31 January 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
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