The Cartesian product of graphs with loops

DOI10.26493/1855-3974.715.c3dzbMath1351.05192arXiv1411.6887OpenAlexW1870348347WikidataQ129366730 ScholiaQ129366730MaRDI QIDQ2835387

Christiaan van de Woestijne, Wilfried Imrich, Johannes Cuno, Florian Lehner, Tetiana Boiko

Publication date: 2 December 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6887

zbMATH Keywords

algorithmsfactorizationsmonoids

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Cartesian products of directed graphs with loops ⋮ Asymmetric colorings of products of graphs and digraphs

This page was built for publication: The Cartesian product of graphs with loops