A bound on the chromatic number of graphs without certain induced subgraphs (Q1150627): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:19, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bound on the chromatic number of graphs without certain induced subgraphs |
scientific article |
Statements
A bound on the chromatic number of graphs without certain induced subgraphs (English)
0 references
1980
0 references
complete subgraph
0 references
chromatic number
0 references