One- and two-page crossing numbers for some types of graphs

DOI10.1080/00207160802524747zbMath1221.05251OpenAlexW2136275995MaRDI QIDQ5747710

Ana Sălăgean, Hongmei He, Erkki Maekinen

Publication date: 14 September 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/14699

zbMATH Keywords

circulant graphsHalin graphstwo-page crossing numberbook drawingsfour-row meshesone-page crossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Unnamed Item

Cites Work

• Halin graphs and the travelling salesman problem
• The book crossing number of a graph
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: One- and two-page crossing numbers for some types of graphs