Recognizing Cartesian graph bundles

DOI10.1016/S0012-365X(96)00242-7zbMath0876.05094OpenAlexW4213365672MaRDI QIDQ1356477

Tomaž Pisanski, Wilfried Imrich, Janez Žerovnik

Publication date: 25 November 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00242-7

zbMATH Keywords

recognitionCartesian graph bundlegraph products

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items

Algorithm for recognizing Cartesian graph bundles, On domination numbers of graphs bundles, On strong graph bundles, Unique square property, equitable partitions, and product-like graphs, Unnamed Item, Nowhere-zero flows in Cartesian bundles of graphs, Graph bundles and Ricci‐flatness, Flow modules and nowhere-zero flows, Mixed fault diameter of Cartesian graph bundles, Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles, An algorithm forK-convex closure and an application, Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs, A local prime factor decomposition algorithm, Distance-residual subgraphs, Time-dependent Lagrangian energy systems on supermanifolds with graph bundles, The edge fault-diameter of Cartesian graph bundles, The grid property and product-like hypergraphs

Cites Work

• Unnamed Item
• Factoring a graph in polynomial time
• Graph multiplication
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Cartesian graph factorization at logarithmic cost per edge
• Edge-colorability of graph bundles
• The chromatic numbers of graph bundles over cycles
• On Isometric Embeddings of Graphs
• Product graph representations
• Factoring cartesian‐product graphs
• Coloring graph bundles
• Isomorphism Classes of Graph Bundles