Crossing critical graphs and path-width (2001)

by P Hliněn´y
Venue:In Proc. 9th Intl. Symposium on Graph Drawing
Add To MetaCart
Results 1 - 2 of 2

Infinite families of crossing-critical graphs with prescribed average degree and crossing number

by Drago Bokal , 2006
"... ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
Abstract not found

Crossing Numbers and Cutwidths

by Hristo N. Djidjev, Imrich Vrtó - JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS , 2003
"... The crossing number of a graph G =(V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The crossing number of a graph G =(V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane.