On Line Graphs with Crossing Number 3
Mallikarjun Ghaleppa, Amit Kumar Yadav, Amabelle Oliva Enanoria · International Journal of Research and Innovation in Social Science · 2025
Kulli, Akka and Beineke obtained a characterization of planar graphs whose line graphs have crossing number 1. Akka, Jendrol, Klesvcv and Panshetty presented a characteri- zation of planar graphs whose line graphs have crossing number 2. The main result of this paper is a characterization of graphs whose line graphs have crossing number 3. The primary contribution of this paper is the characterization of graphs whose line graphs have a crossing number of three. Let be a graph and its line graph. The main result identifies necessary and sufficient structural properties of that ensure has a crossing number of three. Further research can expand on this work by examining families of graphs that exhibit higher crossing numbers and exploring computational approaches for practical applications in visualization and optimization.