Non-intersecting detours in strong oriented graphs

MaRDI QIDQ3513959zbMATH OpenFDO

Authors Susan Van Aardt, Gabriel Semanišin

Publication date 21 July 2008

zbMATH Keywords

digraphlongest pathoriented graphstrong connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Detour saturated oriented graphs
• Intersecting longest paths in chordal graphs
• scientific article; zbMATH DE number 3891406
• Smallest sets of longest paths with empty intersection
• Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

Cited in

(6)

• Routes enumeration in a Boolean with respect to intersection and nonintersection relations
• scientific article; zbMATH DE number 3891406 (Why is no real title available?)
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• Detour saturated oriented graphs
• The minimum number of detours in graphs
• Nontraceable detour graphs

This page was built for publication: Non-intersecting detours in strong oriented graphs

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