AbstractThis note extends results of Fernández, Leighton, and López-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other products and shows that their methods also imply new cancelation laws
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a uniq...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
AbstractThis note extends results of Fernández, Leighton, and López-Presa on the uniqueness of rth r...
V tem kratkem prispevku razširimo rezultate Fernándeza, Leightona in López-Presa o enoličnosti ▫$r$▫...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set...
By Ulam's conjecture every finite graph G can be reconstructed from its deck of vertex deleted subgr...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a uniq...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
AbstractThis note extends results of Fernández, Leighton, and López-Presa on the uniqueness of rth r...
V tem kratkem prispevku razširimo rezultate Fernándeza, Leightona in López-Presa o enoličnosti ▫$r$▫...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set...
By Ulam's conjecture every finite graph G can be reconstructed from its deck of vertex deleted subgr...
AbstractThis work deals with a generalization of the Cartesian product of graphs, the product graph ...
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a uniq...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
DOI
Add to ORKG