Construction of crossing-critical graphs (Q1088998)
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 4002117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of crossing-critical graphs |
scientific article; zbMATH DE number 4002117 |
Statements
Construction of crossing-critical graphs (English)
0 references
1987
0 references
A graph is crossing-critical if deleting any edge decreases its crossing number on the plane. For any \(n\geq 2\) the author presents a construction of an infinite family of 3-connected crossing-critical graphs with crossing number n. Since no parallel edges are used in the construction, this result generalizes an earlier one of the reviewer in Discrete Math. 48, 129-132 (1984; Zbl 0535.05026)].
0 references
crossing number
0 references
crossing-critical graphs
0 references
0.95408225
0 references
0.9120703
0 references
0.9015034
0 references
0.9002677
0 references
0.8973076
0 references
0.8970381
0 references
0 references
