Nonplanarity of iterated line graphs (Q2228162): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:23, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonplanarity of iterated line graphs |
scientific article |
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
