Additional Information
| Author(s) | Klesc Marian, Petrillova Jana |
|---|
On Cartesian products with small crossing numbers
Marian Klesc ♦ Jana Petrillova
Abstract
carpathian_2012_28_1_067_075_abstractKulli at al. started to characterize line graphs with crossing number one. In this paper, the similar problems were solved for the Cartesian products of two graphs. The necessary and sufficient conditions are given for all pairs of graphs G1 and G2 for which the crossing number of their Cartesian product G1 × G2 is one or two.
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration