Greatest common divisors and least common multiples of graphs

DOI10.1007/BF01876635zbMath0794.05101MaRDI QIDQ1321642

V. Pereyra

Publication date: 28 April 1994

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

decomposablecommon divisorcommon multiple

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Least common multiple of graphs ⋮ Face 2-Colorable Embeddings with Faces of Specified Lengths ⋮ On graphs that have a unique least commonMultiple ⋮ Unnamed Item ⋮ Common multiples of complete graphs and a 4-cycle ⋮ Unnamed Item ⋮ Least Common Multiple of a Cycle and a Star

Cites Work

• Isomorphic Factorisations. I: Complete Graphs

This page was built for publication: Greatest common divisors and least common multiples of graphs