Publication date
April 1978
DOI Publisher
Published by Elsevier Inc. ISSN
0095-8956Abstract
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to be n
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to be n
AbstractWe show that every drawing of Cm×Cn with either the m n-cycles pairwise disjoint or the n m-...
A graph G = (V,E) is a set V of vertices and a subset E of unordered pairs of vertices, called edges...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractThere are known several exact results on the crossing numbers of Cartesian products of cycle...
AbstractThere are several known exact results on the crossing numbers of Cartesian products of paths...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractUsing a newly introduced operation on graphs and its counterpart on graph drawings, we prove...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
AbstractA long-standing conjecture states that the crossing number of the Cartesian product of cycle...
summary:Guy and Harary (1967) have shown that, for $k\ge 3$, the graph $P[2k,k]$ is homeomorphic to ...
summary:Guy and Harary (1967) have shown that, for $k\ge 3$, the graph $P[2k,k]$ is homeomorphic to ...
AbstractWe show that every drawing of Cm×Cn with either the m n-cycles pairwise disjoint or the n m-...
A graph G = (V,E) is a set V of vertices and a subset E of unordered pairs of vertices, called edges...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractThere are known several exact results on the crossing numbers of Cartesian products of cycle...
AbstractThere are several known exact results on the crossing numbers of Cartesian products of paths...
Since Harary, Kainen and Schwenk conjectured in 1973 that the crossing number of the Cartesian produ...
AbstractUsing a newly introduced operation on graphs and its counterpart on graph drawings, we prove...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
AbstractThe crossing number of the Cartesian product C3 × Cn of a 3-cycle and an n-cycle is shown to...
AbstractThe exact crossing number is known only for a few specific families of graphs. Cartesian pro...
Abstract. The minimum number of crossings for all drawings of a given graph G on a plane is called i...
We prove that the crossing number of the cartesian product of 2 cycles, C_{m} \times C_{n}, m \le n,...
AbstractA long-standing conjecture states that the crossing number of the Cartesian product of cycle...
summary:Guy and Harary (1967) have shown that, for $k\ge 3$, the graph $P[2k,k]$ is homeomorphic to ...
summary:Guy and Harary (1967) have shown that, for $k\ge 3$, the graph $P[2k,k]$ is homeomorphic to ...
AbstractWe show that every drawing of Cm×Cn with either the m n-cycles pairwise disjoint or the n m-...
A graph G = (V,E) is a set V of vertices and a subset E of unordered pairs of vertices, called edges...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
Add to ORKG