vix.ing · top · new · best · stats

On topological graphs with at most four crossings per edge

2019/09/13 by Eyal Ackerman · 37 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Computational Geometry and Mesh Generation #Conjecture #Corollary #Crossing number (knot theory) #Digital Image Processing Techniques #Discrete mathematics #Graph #Lemma (botany) #Mathematical analysis #Mathematics #Upper and lower bounds

paper · open access · doi:10.1016/j.comgeo.2019.101574

published in Computational Geometry 85, 101574 (Elsevier BV)

openalex publication_date 2019/09/13 · crossref created 2019/09/13 · crossref issued 2019/12/01 · crossref published 2019/12/01 · crossref published-print 2019/12/01 · openalex created_date 2025/10/10 · crossref deposited 2025/10/14 · crossref indexed 2026/06/02 · openalex updated_date 2026/07/28

Citations

Cited by