Transitive closure and transitive reduction in bidirected graphs

DOI10.21136/CMJ.2019.0644-16OpenAlexW2963011352WikidataQ127993106 ScholiaQ127993106MaRDI QIDQ5227103

Ouahiba Bessouf, Abdelkader Khelladi, Thomas Zaslavsky

Publication date: 5 August 2019

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.00179

zbMATH Keywords

matroidsigned graphtransitive closurebidirected graphtransitive reduction

Mathematics Subject Classification ID

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

Related Items (1)

Bi-oriented graphs and four valued logic for preference modelling

Cites Work

• Unnamed Item
• Unnamed Item
• Nowhere-zero integral chains and flows in bidirected graphs
• Erratum to: T. Zaslavsky, signed graphs
• Orientation of signed graphs
• On the notion of balance of a signed graph
• The Transitive Reduction of a Directed Graph

This page was built for publication: Transitive closure and transitive reduction in bidirected graphs