The maximum size of an independent set in a nonplanar graph (Q4068742): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A lower bound for the independence number of a planar graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3760547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank | |||
Normal rank | |||
Revision as of 17:09, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum size of an independent set in a nonplanar graph |
scientific article |
Statements
The maximum size of an independent set in a nonplanar graph (English)
0 references
1975
0 references
