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
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In t...
AbstractThe cartesian product of directed, simple graphs D1 = (V1, A1) and D2 = (V2, A2) is a digrap...
AbstractIn this paper a polynomial algorithm for the prime factorization of finite, connected nonbip...
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$▫...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
AbstractLet G ⊠ H be the strong product of graphs G and H. We give a short proof that χ(G ⊠ H) ⩾χ(G)...
While it has been known for some time that connected non-bipartite graphs have unique prime factoriz...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In t...
AbstractThe cartesian product of directed, simple graphs D1 = (V1, A1) and D2 = (V2, A2) is a digrap...
AbstractIn this paper a polynomial algorithm for the prime factorization of finite, connected nonbip...
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$▫...
AbstractIt is shown that every connected graph has a unique prime factor decomposition with respect ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
Every connected graph G with radius r(G) and independence num-ber α(G) obeys α(G) ≥ r(G). Recently ...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
AbstractLet G ⊠ H be the strong product of graphs G and H. We give a short proof that χ(G ⊠ H) ⩾χ(G)...
While it has been known for some time that connected non-bipartite graphs have unique prime factoriz...
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect t...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In t...
AbstractThe cartesian product of directed, simple graphs D1 = (V1, A1) and D2 = (V2, A2) is a digrap...
AbstractIn this paper a polynomial algorithm for the prime factorization of finite, connected nonbip...
DOI
Add to ORKG