On Cartesian skeletons of graphs

DOI10.26493/1855-3974.114.4bbzbMath1190.05099OpenAlexW2144067625WikidataQ129337749 ScholiaQ129337749MaRDI QIDQ3552332

Wilfried Imrich, Richard H. Hammack

Publication date: 15 April 2010

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

Full work available at URL: https://doi.org/10.26493/1855-3974.114.4bb

zbMATH Keywords

graph algorithmsgraph productCartesian skeletonprime factorization of graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items (14)

Distance formula for direct-co-direct product in the case of disconnected factors ⋮ Edge-transitive products ⋮ A prime factor theorem for bipartite graphs ⋮ Covering arrays on product graphs ⋮ On some metric properties of direct-co-direct product ⋮ The pre-hull number and lexicographic product ⋮ Strong products of hypergraphs: unique prime factorization theorems and algorithms ⋮ On idomatic partitions of direct products of complete graphs ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Vertex-transitive direct products of graphs ⋮ A local prime factor decomposition algorithm ⋮ Asymmetric colorings of products of graphs and digraphs ⋮ Digraphs Products ⋮ Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs

This page was built for publication: On Cartesian skeletons of graphs