A note on the crossing number of the cone of a graph
From MaRDI portal
Publication:2053697
DOI10.1007/s00373-021-02361-2zbMath1479.05073OpenAlexW3173861973WikidataQ112879335 ScholiaQ112879335MaRDI QIDQ2053697
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02361-2
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A framework for solving VLSI graph layout problems
- Non-planar core reduction of graphs
- Planarizing Graphs - A Survey and Annotated Bibliography
- 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
- Crossing Numbers of Graphs
- Unnamed Item
This page was built for publication: A note on the crossing number of the cone of a graph