Zmazek, Blaž; Žerovnik, Janez Recognizing weighted directed Cartesian graph bundles. (English) Zbl 0966.05049 Discuss. Math., Graph Theory 20, No. 1, 39-56 (2000). From the authors’ abstract: We show that methods for recognizing Cartesian graph bundles can be generalized to weighted digraphs. The main result is an algorithm which lists the sets of degenerate arcs for all representations of a digraph as a weighted directed Cartesian graph bundle over simple base digraphs not containing the transitive tournament on three vertices. Reviewer: T.Andreae (Hamburg) Cited in 6 Documents MSC: 05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) Keywords:half-convexity; recognizing Cartesian graph bundles; weighted digraphs PDF BibTeX XML Cite \textit{B. Zmazek} and \textit{J. Žerovnik}, Discuss. Math., Graph Theory 20, No. 1, 39--56 (2000; Zbl 0966.05049) Full Text: DOI Link OpenURL