A bound on the chromatic number of graphs without certain induced subgraphs (Q1150627): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(80)90093-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019540488 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite triangulated graphs / rank | |||
Normal rank | |||
Latest revision as of 11:54, 13 June 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
