Zobrazeno 1 - 1
of 1
pro vyhledávání: '"common multiple of graphs"'
Publikováno v:
Cubo, Vol 24, Iss 1, Pp 53-62 (2022)
A graph $G$ without isolated vertices is a least common multiple of two graphs $H_1$ and $H_2$ if $G$ is a smallest graph, in terms of number of edges, such that there exists a decomposition of $G$ into edge disjoint copies of $H_1$ and there exists
Externí odkaz:
https://doaj.org/article/7a2d7f6d8bd5499bb7aa773993ff8ff7
