Infinite families of crossing-critical graphs with a given crossing number (Q790825)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3849254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infinite families of crossing-critical graphs with a given crossing number |
scientific article; zbMATH DE number 3849254 |
Statements
Infinite families of crossing-critical graphs with a given crossing number (English)
0 references
1984
0 references
The author proves that, for each natural number \(n\geq 3\), there are infinitely many 3-connected graphs which have crossing number n and which are minimal under this restriction. He conjectures that, for \(n=2\), there are only finitely many such graphs. For \(n=1\), there are only two such graphs by Kuratowski's theorem.
0 references
crossing-critical
0 references
3-connected graphs
0 references
crossing number
0 references
0.8520825505256653
0 references
0.8161799907684326
0 references
0.8118842244148254
0 references
0.8112683892250061
0 references
0.8104762434959412
0 references
