On recognizing Cartesian graph bundles

DOI10.1016/S0012-365X(00)00254-5MaRDI QIDQ5936045zbMATH OpenFDO

Authors Blaž Zmazek, Janez Žerovnik

Publication date 30 June 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00254-5

zbMATH Keywords

Cartesian graph bundlepolynomial algorithmrecognition

Mathematics Subject Classification ID

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

Recommendations

• Algorithm for recognizing Cartesian graph bundles
• Recognizing weighted directed cartesian graph bundles
• Recognizing Cartesian graph bundles
• On recognition of strong graph bundles
• Unique square property and fundamental factorizations of graph bundles

Cited in

(14)

• The edge fault-diameter of Cartesian graph bundles
• Unique square property and fundamental factorizations of graph bundles
• Recognizing Cartesian graph bundles
• Algorithm for recognizing Cartesian graph bundles
• On strong graph bundles
• Mixed fault diameter of Cartesian graph bundles
• An algorithm forK-convex closure and an application
• On recognition of strong graph bundles
• Recognizing weighted directed cartesian graph bundles
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
• Robust Factorizations and Colorings of Tensor Graphs
• Recognizing graph products and bundles
• On domination numbers of graphs bundles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936045)