DOIAbstract
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We improve a method of Winkler (1987) for partitioning I in a way suitable for finding the unique prime factorization of G
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We improve a method of Winkler (1987) for partitioning I in a way suitable for finding the unique prime factorization of G
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary an...
AbstractLet Kkd denote the Cartesian product of d copies of the complete graph Kk. We prove necessar...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
By a result of McKenzie [7] all finite directed graphs that satisfy certain connectivity conditions ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial...
The Cartesian product G??????????????????????????????????????????????????? V(G)×V(H) and (a,x)(b,y) ...
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
AbstractThis work is concerned with the prime factor decomposition (PFD) of strong product graphs. A...
AbstractWe present an algorithm that determines the prime factors of connected graphs with respect t...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractIn this paper a polynomial algorithm for the prime factorization of finite, connected nonbip...
International audienceIn this article we present the L2-section, a tool used to represent a hypergra...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary an...
AbstractLet Kkd denote the Cartesian product of d copies of the complete graph Kk. We prove necessar...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
By a result of McKenzie [7] all finite directed graphs that satisfy certain connectivity conditions ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
We present a polynomial-time algorithm for deciding whether a given connected graph is a non-trivial...
The Cartesian product G??????????????????????????????????????????????????? V(G)×V(H) and (a,x)(b,y) ...
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
AbstractThis work is concerned with the prime factor decomposition (PFD) of strong product graphs. A...
AbstractWe present an algorithm that determines the prime factors of connected graphs with respect t...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractIn this paper a polynomial algorithm for the prime factorization of finite, connected nonbip...
International audienceIn this article we present the L2-section, a tool used to represent a hypergra...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary an...
AbstractLet Kkd denote the Cartesian product of d copies of the complete graph Kk. We prove necessar...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
Add to ORKG