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

DOI10.7151/dmgt.1507zbMath1217.05100OpenAlexW1965366330MaRDI QIDQ2997605

Werner Klöckl, Wilfried Imrich

Publication date: 9 May 2011

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

Full work available at URL: https://doi.org/10.7151/dmgt.1507

zbMATH Keywords

graph algorithmsdirected graphscardinal product

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

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 II