Pages that link to "Item:Q5902524"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902524):

Displaying 13 items.

• Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
• On crossing numbers of hypercubes and cube connected cycles (Q688627) (← links)
• A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
• Drawing a graph in a hypercube (Q2500992) (← links)
• On Eggleton and Guy's conjectured upper bound for the crossing number of the \(n\)-cube (Q2777504) (← links)
• The crossing number of folded hypercubes (Q2811839) (← links)
• The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube (Q2825477) (← links)
• Improved upper bounds on the crossing number (Q3602937) (← links)
• An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
• (Q4331202) (← links)
• (Q4694734) (← links)
• Bounds for the crossing number of the <i>N</i>‐cube (Q5753969) (← links)
• Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes (Q6081548) (← links)