Antisymmetrical Digraphs
From MaRDI portal
Publication:5543330
DOI10.4153/CJM-1967-101-8zbMATH Open0161.20905OpenAlexW4256179294MaRDI QIDQ5543330FDOQ5543330
Authors: William T. Tutte 
Publication date: 1967
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1967-101-8
Cited In (11)
- On flows in simple bidirected and skew-symmetric networks
- The factorization of graphs. II
- Minimum mean cycle problem in bidirected and skew-symmetric graphs
- Maximum matching in almost linear time on graphs of bounded clique-width
- Free multiflows in bidirected and skew-symmetric graphs
- Path problems in skew-symmetric graphs
- Balanced network flows. IV: Duality and structure theory.
- Making bidirected graphs strongly connected
- Min-cost multiflows in node-capacitated undirected networks
- Title not available (Why is that?)
- Faster graph bipartization
This page was built for publication: Antisymmetrical Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543330)
