The crossing number of chordal ring networks

DOI10.1007/S10998-015-0097-9zbMath1363.05048OpenAlexW2258882415MaRDI QIDQ313472

Mezab-e-Rehmat, Imran Javaid, Muhammad Salman, Muhammad Imran

Publication date: 9 September 2016

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-015-0097-9

zbMATH Keywords

crossing numberplanar graphchordal ringgood drawingoptimal drawing

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• A framework for solving VLSI graph layout problems
• The crossing number of \(P(N,3)\)
• The crossing number of \(C(n; \{1,3\})\)
• The crossing number of \(C(mk;\{1,k\})\)
• The crossing number of \(C(3k+1;\{1,k\})\)
• Crossing Number is NP-Complete
• Self-dual configurations and regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The crossing number of chordal ring networks