One- and two-page crossing numbers for some types of graphs
From MaRDI portal
(Redirected from Publication:5747710)
book drawingscirculant graphsfour-row meshesHalin graphsone-page crossing numbertwo-page crossing number
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) 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
Cited in
(6)- 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
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- An improved fixed-parameter algorithm for one-page crossing minimization
- SOFSEM 2005: Theory and Practice of Computer Science
- On the page-number of a circulant graph
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)
