The Crossing Number of the Cone of a Graph
From MaRDI portal
Publication:4579956
DOI10.1137/17M1115320zbMath1398.68383OpenAlexW2507610879MaRDI QIDQ4579956
Bojan Mohar, Alan Arroyo, Marek Derňár, Carlos A. Alfaro
Publication date: 10 August 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1115320
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane ⋮ Nonplanarity of iterated line graphs ⋮ A note on the crossing number of the cone of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Towards the Albertson conjecture
- Crossings, colorings, and cliques
- Coloring graphs with crossings
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
- The Crossing Number of the Cone of a Graph
- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
- Crossing-Free Subgraphs
- Some Extremal Properties of Bipartite Subgraphs
- On the Number of Crossings in a Complete Graph
This page was built for publication: The Crossing Number of the Cone of a Graph