#### Filter Results:

#### Publication Year

2011

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

ization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87–97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numbers of graphs obtained… (More)

The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of crossing numbers were obtained. The crossing numbers of Cartesian products of paths, cycles or stars with… (More)

- ‹
- 1
- ›