Infinite families of crossing-critical graphs with a given crossing number (Q790825): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q228790 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Carsten Thomassen / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Crossing Number Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3910541 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On stable crossing numbers / rank | |||
Normal rank | |||
Latest revision as of 11:15, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite families of crossing-critical graphs with a given crossing number |
scientific article |
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
