The Crossing Number of the Cone of a Graph
From MaRDI portal
Publication:2961536
DOI10.1007/978-3-319-50106-2_33zbMath1398.68382arXiv1608.07680OpenAlexW2964046653MaRDI QIDQ2961536
Alan Arroyo, Bojan Mohar, Marek Derňár, Carlos A. Alfaro
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07680
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- 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
- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
- 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
