Fast recognition of direct and strong products

DOI10.26493/1855-3974.320.43ezbMath1306.05236OpenAlexW2149335154WikidataQ129355253 ScholiaQ129355253MaRDI QIDQ2940100

Wilfried Imrich, Richard H. Hammack

Publication date: 26 January 2015

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

Full work available at URL: https://doi.org/10.26493/1855-3974.320.43e

zbMATH Keywords

graph productsalgorithms.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (1)

On the Cartesian skeleton and the factorization of the strong product of digraphs

This page was built for publication: Fast recognition of direct and strong products