Factoring directed graphs with respect to the cardinal product in polynomial time

DOI10.7151/dmgt.1385zbMath1142.05039OpenAlexW4251695123MaRDI QIDQ3504810

Werner Klöckl, Wilfried Imrich

Publication date: 18 June 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2da4baf7ee90c0f3e8e050fc585e5af164e3872c

zbMATH Keywords

graph algorithmsdirected graphscardinal product

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Recognizing triangulated Cartesian graph products ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ The structure of 2-colored best match graphs ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ Digraphs Products

This page was built for publication: Factoring directed graphs with respect to the cardinal product in polynomial time