Recognizing weighted directed cartesian graph bundles

DOI10.7151/DMGT.1105MaRDI QIDQ4522459zbMATH OpenOpenAlexFDO

Authors Blaž Zmazek, Janez Žerovnik

Publication date 20 August 2001

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://dk.um.si/Dokument.php?id=110430&dn=

zbMATH Keywords

half-convexityrecognizing Cartesian graph bundlesweighted digraphs

Mathematics Subject Classification ID

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

Recommendations

• Recognizing Cartesian graph bundles
• On recognizing Cartesian graph bundles
• Algorithm for recognizing Cartesian graph bundles
• On weighted directed graphs
• On recognition of strong graph bundles
• Weighted complexities of graph products and bundles
• An algebraic framework of weighted directed graphs
• scientific article; zbMATH DE number 2190098
• Recognizing weighted disk contact graphs
• On weighted graph homomorphisms

Cited in

(10)

• The edge fault-diameter of Cartesian graph bundles
• Recognizing Cartesian graph bundles
• Mixed fault diameter of Cartesian graph bundles
• On recognition of strong graph bundles
• Cyclic bundle hamiltonicity
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• On recognizing Cartesian graph bundles
• scientific article; zbMATH DE number 7692362 (Why is no real title available?)
• Graph bundles and Ricci‐flatness
• On domination numbers of graphs bundles

This page was built for publication: Recognizing weighted directed cartesian graph bundles

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