The crossing number of \(K_{5,n+1} \setminus e\)
From MaRDI portal
Publication:2177670
DOI10.1016/j.amc.2020.125075zbMath1475.05123OpenAlexW3009285846MaRDI QIDQ2177670
Publication date: 6 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125075
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the crossing numbers of Cartesian products of wheels and trees
- Minimal graphs with crossing number at least \(k\)
- On the crossing numbers of Cartesian products with paths
- The crossing numbers of join of the special graph on six vertices with path and cycle
- A note on the parity of the number of crossings of a graph
- A successful concept for measuring non-planarity of graphs: The crossing number.
- On a crossing number result of Richter and Thomassen
- Zarankiewicz's conjecture is finite for each fixed \(m\)
- Two recursive inequalities for crossing numbers of graphs
- The crossing number of the Cartesian product of paths with complete graphs
- On the decay of crossing numbers
- Infinite families of crossing-critical graphs with prescribed average degree and crossing number
- The crossing numbers of join products of paths with graphs of order four
- Crossing Number is NP-Complete
- The Join of Graphs and Crossing Numbers
- On the crossing numbers of products of cycles and graphs of order four
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- The crossing numbers of products of paths and stars with 4‐vertex graphs
- The crossing number of K11 is 100
- Improvement on the Decay of Crossing Numbers
- The crossing number of K5,n
- Crossing Number Problems
- On a problem of P. Turan concerning graphs
This page was built for publication: The crossing number of \(K_{5,n+1} \setminus e\)
