Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six

Marián KleščŠtefan Schrötter — 2013

Discussiones Mathematicae Graph Theory

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 all graphs of order at most four are known. Moreover, except of six graphs, the crossing numbers of Cartesian products G⃞K1,n for all other...

The crossing numbers of join products of paths with graphs of order four

Marián KleščStefan Schrötter — 2011

Discussiones Mathematicae Graph Theory

Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization 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 as join product of two graphs. In the paper, the exact values of crossing numbers...

On rainbowness of semiregular polyhedra

Stanislav JendroľŠtefan Schrötter — 2008

Czechoslovak Mathematical Journal

We introduce the rainbowness of a polyhedron as the minimum number k such that any colouring of vertices of the polyhedron using at least k colours involves a face all vertices of which have different colours. We determine the rainbowness of Platonic solids, prisms, antiprisms and ten Archimedean solids. For the remaining three Archimedean solids this parameter is estimated.

Page 1

Download Results (CSV)