Digraph Decompositions and Eulerian Systems

DOI10.1137/0608028zbMath0641.05019OpenAlexW2048602845MaRDI QIDQ3781773

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 decompositionsisotropic systemsEulerian system

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

Interlacement of double curves of immersed spheres, Minimally 3-connected isotropic systems, Isotropic systems, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, The rank-width of edge-coloured graphs, Graphic presentations of isotropic systems, Classification of real Bott manifolds and acyclic digraphs, The nullity theorem for principal pivot transform, Solving problems on graphs of high rank-width, An efficient algorithm to recognize locally equivalent graphs, Weighted Interlace Polynomials, $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs, Recognizing locally equivalent graphs, A note on small covers over cubes, \(O(m\log n)\) split decomposition of strongly-connected graphs, O(m logn) Split Decomposition of Strongly Connected Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Reconnaissance des graphes de cordes
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• A Combinatorial Decomposition Theory
• Decomposition of Directed Graphs
• Recognizing circle graphs in polynomial time