Recognizing triangulated Cartesian graph products

DOI10.1016/J.DISC.2011.08.001MaRDI QIDQ658038zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Recognizing Cartesian products of matrices and polytopes
• scientific article; zbMATH DE number 739124
• The recognition of triangle graphs
• The recognition of triangle graphs
• Recognizing Cartesian graph bundles
• Graph decompositions for cartesian products
• Distinguishing Cartesian products of countable graphs
• scientific article; zbMATH DE number 2075761
• scientific article; zbMATH DE number 568809

Cites work

• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• Cartesian graph factorization at logarithmic cost per edge
• Factoring cardinal product graphs in polynomial time
• Factoring directed graphs with respect to the cardinal product in polynomial time
• Finding the prime factors of strong direct product graphs in polynomial time
• Local algorithms for the prime factorization of strong product graphs
• Profile minimization on compositions of graphs
• Profile minimization on products of graphs
• Recognizing Cartesian products in linear time
• The profile of the Cartesian product of graphs

Cited in

(3)

• Recognizing Cartesian products in linear time
• P₃-factorization of triangulated Cartesian product of complete graphs
• Recognizing Cartesian graph bundles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658038)