On recognizing Cartesian graph bundles (Q5936045): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:41, 5 March 2024
scientific article; zbMATH DE number 1612905
Language | Label | Description | Also known as |
---|---|---|---|
English | On recognizing Cartesian graph bundles |
scientific article; zbMATH DE number 1612905 |
Statements
On recognizing Cartesian graph bundles (English)
0 references
30 June 2002
0 references
Let \(B\) and \(F\) be graphs. A graph \(G\) is a Cartesian graph bundle with fibre \(F\) over the base graph \(B\) if there is a mapping \(p:G\to B\) which satisfies the following conditions: (1) \(p\) maps adjacent vertices of \(G\) to adjacent or identical vertices of \(B\). (2) \(p\) maps edges to edges or vertices. (3) For each \(v\in V(B)\), \(p^-(v)\cong F\), and for every \(e\in E(B)\), \(p^{-1}(e)\) is the Cartesian product of \(K_2\) and \(F\). The authors extend a polynomial algorithm for recognition of Cartesian graph bundles over \(K_3\)-free simple base to one for recognition of Cartesian graph bundles over a \(K_4\setminus e\) simple base, without induced \(K_{3,3}\).
0 references
Cartesian graph bundle
0 references
polynomial algorithm
0 references
recognition
0 references