The crossing number of locally twisted cubes L T Q_n
From MaRDI portal
Publication:1671371
Recommendations
- An upper bound for the crossing number of locally twisted cubes.
- On Eggleton and Guy's conjectured upper bound for the crossing number of the n-cube
- scientific article; zbMATH DE number 1735732
- Bounds for the crossing number of the N‐cube
- An improved upper bound on the crossing number of the hypercube
Cites work
- A framework for solving VLSI graph layout problems
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- Additive combinatorics
- An improved upper bound on the crossing number of the hypercube
- An upper bound for the crossing number of augmented cubes
- Augmented cubes
- Bounds for the crossing number of the N‐cube
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Crossing Number is NP-Complete
- Crossing Number Problems
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Distinct distances in the plane
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- scientific article; zbMATH DE number 3813532 (Why is no real title available?)
- scientific article; zbMATH DE number 3957138 (Why is no real title available?)
- scientific article; zbMATH DE number 1054768 (Why is no real title available?)
- scientific article; zbMATH DE number 1452728 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- New bounds on crossing numbers
- New lower bound techniques for VLSI
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- On a problem of P. Turan concerning graphs
- On crossing numbers of hypercubes and cube connected cycles
- On Eggleton and Guy's conjectured upper bound for the crossing number of the n-cube
- On the crossing number of \(K_{ m } \square P_{n}\)
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- On the crossing numbers of loop networks and generalized Petersen graphs
- On the Number of Incidences Between Points and Curves
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Panconnectivity of locally twisted cubes
- Some provably hard crossing number problems
- The k most frequent distances in the plane
- The crossing number of \(C(n; \{1,3\})\)
- The crossing number of \(K_{2,m}\square P_n\)
- The crossing number of K11 is 100
- The crossing number of c4 × c4
- The crossing number of folded hypercubes
- The crossing number of the generalized Petersen graph \(P(10, 3)\) is six
- The crossing numbers of generalized Petersen graphs with small order
- The locally twisted cubes
- Toward a theory of crossing numbers
Cited in
(9)- The crossing number of folded hypercubes
- An upper bound for the crossing number of augmented cubes
- scientific article; zbMATH DE number 1735732 (Why is no real title available?)
- An upper bound for the crossing number of locally twisted cubes.
- scientific article; zbMATH DE number 6401236 (Why is no real title available?)
- Bounds for the crossing number of the N‐cube
- Communication Performance Evaluation of the Locally Twisted Cube
- The generalized 4-connectivity of locally twisted cubes
- Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
This page was built for publication: The crossing number of locally twisted cubes \(L T Q_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671371)