Algorithm for recognizing Cartesian graph bundles
From MaRDI portal
Publication:1613382
DOI10.1016/S0166-218X(01)00296-7zbMath1004.05055OpenAlexW2176839462MaRDI QIDQ1613382
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00296-7
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Cyclic bundle Hamiltonicity ⋮ Fault-diameter of Cartesian graph bundles ⋮ On domination numbers of graphs bundles ⋮ On strong graph bundles ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ Graph bundles and Ricci‐flatness ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm ⋮ Wide diameter of Cartesian graph bundles ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ The grid property and product-like hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Associative products of graphs
- Characteristic polynomials of some weighted graph bundles and its application to links
- Recognizing Cartesian graph bundles
- Edge-colorability of graph bundles
- The chromatic numbers of graph bundles over cycles
- Caracteristics polynomials of some grap bundlesII
- Product graph representations
- Factoring cartesian‐product graphs
- Coloring graph bundles
- Isomorphism Classes of Graph Bundles
- On recognizing Cartesian graph bundles
This page was built for publication: Algorithm for recognizing Cartesian graph bundles
