Digraph Decompositions and Eulerian Systems

DOI10.1137/0608028MaRDI QIDQ3781773zbMATH OpenOpenAlexFDO

Authors André Bouchet

Publication date 1987

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0608028

zbMATH Keywords

digraph decompositionsEulerian systemisotropic systems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites work

• A Combinatorial Decomposition Theory
• Decomposition of Directed Graphs
• Graph theory with applications
• Graphic presentations of isotropic systems
• scientific article; zbMATH DE number 3933116 (Why is no real title available?)
• Isotropic systems
• Recognizing circle graphs in polynomial time
• Reconnaissance des graphes de cordes
• Reducing prime graphs and recognizing circle graphs

Cited in

(24)

• Isotropic systems
• Graphic presentations of isotropic systems
• An efficient algorithm to recognize locally equivalent graphs
• Minimally 3-connected isotropic systems
• Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
• Solving problems on graphs of high rank-width
• The rank-width of edge-coloured graphs
• The nullity theorem for principal pivot transform
• Interlacement of double curves of immersed spheres
• Classification of real Bott manifolds and acyclic digraphs
• F-rank-width of (edge-colored) graphs
• scientific article; zbMATH DE number 4134096 (Why is no real title available?)
• Weighted interlace polynomials
• O(m n) split decomposition of strongly connected graphs
• scientific article; zbMATH DE number 3941564 (Why is no real title available?)
• scientific article; zbMATH DE number 4091535 (Why is no real title available?)
• scientific article; zbMATH DE number 15867 (Why is no real title available?)
• scientific article; zbMATH DE number 1947434 (Why is no real title available?)
• scientific article; zbMATH DE number 1753166 (Why is no real title available?)
• A note on small covers over cubes
• Recognizing locally equivalent graphs
• Covering a graph with minimal local sets
• An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology
• \(O(m\log n)\) split decomposition of strongly-connected graphs

This page was built for publication: Digraph Decompositions and Eulerian Systems

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