Recognizing Cartesian graph bundles (Q1356477): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00242-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4213365672 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing Cartesian graph bundles |
scientific article |
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
