Nonplanarity of iterated line graphs (Q2228162)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonplanarity of iterated line graphs |
scientific article; zbMATH DE number 7311454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonplanarity of iterated line graphs |
scientific article; zbMATH DE number 7311454 |
Statements
Nonplanarity of iterated line graphs (English)
0 references
16 February 2021
0 references
Summary: The 1-crossing index of a graph \(G\) is the smallest integer \(k\) such that the \(k\) th iterated line graph of \(G\) has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5. Moreover, we give a full characterization of all graphs with respect to their 1-crossing index.
0 references
0.8941428065299988
0 references
0.8281919956207275
0 references
0.8124819397926331
0 references
0.8124819397926331
0 references
