scientific article
From MaRDI portal
Publication:2777507
zbMath0984.05068MaRDI QIDQ2777507
Publication date: 7 March 2002
Full work available at URL: https://eudml.org/doc/34515
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (8)
On strong graph bundles ⋮ Graph bundles and Ricci‐flatness ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Strong products of hypergraphs: unique prime factorization theorems and algorithms ⋮ 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 ⋮ The edge fault-diameter of Cartesian graph bundles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring a graph in polynomial time
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- The maximum genus of graph bundles
- 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
- Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
- Caracteristics polynomials of some grap bundlesII
- Product graph representations
- Factoring cartesian‐product graphs
- Coloring graph bundles
- Recognizing weighted directed cartesian graph bundles
- Isomorphism Classes of Graph Bundles
- Cardinal multiplication of structures with a reflexive relation
This page was built for publication:
