On the crossing numbers of loop networks and generalized Petersen graphs
From MaRDI portal
Publication:2575797
DOI10.1016/J.DISC.2004.07.036zbMATH Open1080.05026OpenAlexW2092940828MaRDI QIDQ2575797FDOQ2575797
Publication date: 6 December 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.036
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Circulants and their connectivities
- A combinatorial problem related to distributed loop networks
- The crossing number of \(P(N,3)\)
- A framework for solving VLSI graph layout problems
- Minimal diameter double-loop networks: Dense optimal families
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- The crossing number of K5,n
- Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).
- The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
- Crossing Number Problems
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Crossing-number critical graphs have bounded path-width
- Crossing numbers of sequences of graphs II: Planar tiles
- The crossing numbers of some generalized Petersen graphs.
- On the crossing numbers of certain generalized Petersen graphs
Cited In (13)
- Skewness of generalized Petersen graphs and related graphs
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- On the minimum vertex cover of generalized Petersen graphs
- The crossing number of chordal ring networks
- Title not available (Why is that?)
- On the page number of triple-loop networks with even cardinality.
- The crossing number of locally twisted cubes \(L T Q_n\)
- Unexpected behaviour of crossing sequences
- The crossing number of \(C(n; \{1,3\})\)
- An upper bound for the crossing number of augmented cubes
- Title not available (Why is that?)
- A survey of graphs with known or bounded crossing numbers
- Distance-balanced graphs: symmetry conditions
Recommendations
This page was built for publication: On the crossing numbers of loop networks and generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575797)