On recognizing Cartesian graph bundles

DOI10.1016/S0012-365X(00)00254-5zbMath0988.05065MaRDI QIDQ5936045

Janez Žerovnik, Blaž Zmazek

Publication date: 30 June 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmrecognitionCartesian graph bundle

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Algorithm for recognizing Cartesian graph bundles ⋮ On domination numbers of graphs bundles ⋮ On strong graph bundles ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The edge fault-diameter of Cartesian graph bundles

This page was built for publication: On recognizing Cartesian graph bundles