| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654581 | European Journal of Combinatorics | 2009 | 8 Pages |
Abstract
A Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph product. Let GG be a kGkG-edge connected graph and D̄c(G) be the largest diameter of subgraphs of GG obtained by deleting c
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Iztok Banič, Rija Erveš, Janez Žerovnik,