✦ LIBER ✦

Recognizing Cartesian graph bundles

✍ Scribed by Wilfried Imrich; Tomaẑ Pisanski; Janez Ẑerovnik

Book ID: 104113766
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 574 KB
Volume: 167-168
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00242-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On recognizing Cartesian graph bundles

✍ Blaž Zmazek; Janez Žerovnik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Algorithm for Recognizing Cartesian Grap

Algorithm for Recognizing Cartesian Graph Bundles

✍ Blaẑ Zmazek; Janez Ẑerovnik 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Recognizing triangulated Cartesian graph

Recognizing triangulated Cartesian graph products

✍ Shehzad Afzal; Clemens Brand 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Nowhere-zero flows in Cartesian bundles

Nowhere-zero flows in Cartesian bundles of graphs

✍ Edita Rollová; Martin Škoviera 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Coloring graph bundles

✍ Sandi Klavžar; Bojan Mohar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 502 KB

## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. © 1995 John Wiley & Sons, Inc.

Recognizing Cartesian products in linear

Recognizing Cartesian products in linear time

✍ Wilfried Imrich; Iztok Peterin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 201 KB