A note on the crossing number of the cone of a graph
From MaRDI portal
Publication:2053697
DOI10.1007/S00373-021-02361-2zbMATH Open1479.05073OpenAlexW3173861973WikidataQ112879335 ScholiaQ112879335MaRDI QIDQ2053697FDOQ2053697
Authors: Zongpeng Ding, Yuanqiu Huang
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Graph theory
- Crossing numbers of graphs
- A framework for solving VLSI graph layout problems
- Planarizing graphs---a survey and annotated bibliography
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Non-planar core reduction of graphs
- Improved lower bounds on book crossing numbers of complete graphs
- The crossing number of the cone of a graph
Cited In (2)
This page was built for publication: A note on the crossing number of the cone of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053697)