Recognizing triangulated Cartesian graph products

DOI10.1016/j.disc.2011.08.001zbMath1232.05196OpenAlexW2091195971MaRDI QIDQ658038

Shehzad Afzal, Clemens W. Brand

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.001

zbMATH Keywords

product-like structures in triangular meshes

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

P₃-factorization of triangulated Cartesian product of complete graphs

Cites Work

• Unnamed Item
• Local algorithms for the prime factorization of strong product graphs
• Finding the prime factors of strong direct product graphs in polynomial time
• Recognizing Cartesian products in linear time
• The profile of the Cartesian product of graphs
• Cartesian graph factorization at logarithmic cost per edge
• Factoring cardinal product graphs in polynomial time
• Profile minimization on compositions of graphs
• Profile minimization on products of graphs
• Factoring directed graphs with respect to the cardinal product in polynomial time

This page was built for publication: Recognizing triangulated Cartesian graph products