Nonplanarity of Iterated Line Graphs
The 1-crossing index of a graph G is the smallest integer k such that the kth 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 r...
| Autor principal: | |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
Wiley
2020-01-01
|
| Col·lecció: | Journal of Mathematics |
| Accés en línia: | http://dx.doi.org/10.1155/2020/5752806 |