Least common multiple of graphs
From MaRDI portal
Recommendations
Cites work
- COMMON MULTIPLES OF COMPLETE GRAPHS
- Common multiples of complete graphs and a 4-cycle
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Greatest common divisors and least common multiples of graphs
- scientific article; zbMATH DE number 1186106 (Why is no real title available?)
- scientific article; zbMATH DE number 1109404 (Why is no real title available?)
- scientific article; zbMATH DE number 749302 (Why is no real title available?)
- scientific article; zbMATH DE number 969114 (Why is no real title available?)
Cited in
(10)- Greatest common divisors and least common multiples of graphs
- scientific article; zbMATH DE number 1186106 (Why is no real title available?)
- scientific article; zbMATH DE number 2076809 (Why is no real title available?)
- scientific article; zbMATH DE number 908559 (Why is no real title available?)
- scientific article; zbMATH DE number 1409210 (Why is no real title available?)
- On graphs that have a unique least common multiple
- On the bounds for sizes of least common multiples of several pairs of graphs.
- scientific article; zbMATH DE number 5064167 (Why is no real title available?)
- scientific article; zbMATH DE number 2215803 (Why is no real title available?)
- scientific article; zbMATH DE number 7656342 (Why is no real title available?)
This page was built for publication: Least common multiple of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178164)