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

DOI10.1080/00207160802524747MaRDI QIDQ5747710zbMATH OpenOpenAlexFDO

Authors Hongmei He, Ana Sălăgean, Erkki Mäkinen

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

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

Recommendations

• 1-page and 2-page drawings with bounded number of crossings per edge
• 1-page and 2-page drawings with bounded number of crossings per edge
• The mixed page number of graphs
• Crossing numbers of graphs
• The 2-page crossing number of \(K_{n}\)
• On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page
• Crossing numbers for certain distance graphs
• scientific article; zbMATH DE number 969978
• On graphs whose line graphs have crossing number one
• The \(2\)-page crossing number of \(K_n\)

Cites work

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

Cited in

(5)

• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• SOFSEM 2005: Theory and Practice of Computer Science
• An improved fixed-parameter algorithm for one-page crossing minimization
• 1-page and 2-page drawings with bounded number of crossings per edge
• 1-page and 2-page drawings with bounded number of crossings per edge

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747710)