Recognizing Cartesian graph bundles (Q1356477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recognizing Cartesian graph bundles |
scientific article; zbMATH DE number 1018528
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing Cartesian graph bundles |
scientific article; zbMATH DE number 1018528 |
Statements
Recognizing Cartesian graph bundles (English)
0 references
25 November 1997
0 references
Graph bundles are extensions of covering graphs and graph products. The authors develop an algorithm that finds a representation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over a triangle-free simple base. The problem of recognizing graph bundles over general base remains open.
0 references
recognition
0 references
graph products
0 references
Cartesian graph bundle
0 references
0 references
0.9536674
0 references
0.9317755
0 references
0 references
0.8804294
0 references
0.8580376
0 references
0 references
