Skew-symmetric graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Skew-symmetric graph" in English language version.

refsWebsite

Global rank English rank

5doi.org

2^nd place

2arxiv.org

69^th place

59^th place

arxiv.org

Zaslavsky (1991), Section 5; Babenko (2006). Zaslavsky, Thomas (1991), "Orientation of signed graphs", European Journal of Combinatorics, 12 (4): 361–375, doi:10.1016/s0195-6698(13)80118-7. Babenko, Maxim A. (2006), "Acyclic bidirected and skew-symmetric graphs: algorithms and structure", Computer Science – Theory and Applications, Lecture Notes in Computer Science, vol. 3967, Springer-Verlag, pp. 23–34, arXiv:math/0607547, doi:10.1007/11753728_6, ISBN 978-3-540-34166-6.
Goldberg & Karzanov (2004); Tutte (1967). Goldberg, Andrew V.; Karzanov, Alexander V. (2004), "Maximum skew-symmetric flows and matchings", Mathematical Programming, 100 (3): 537–568, arXiv:math/0304290, doi:10.1007/s10107-004-0505-z. Tutte, W. T. (1967), "Antisymmetrical digraphs", Canadian Journal of Mathematics, 19: 1101–1117, doi:10.4153/CJM-1967-101-8.

doi.org

Polar graphs were introduced by Zelinka (1974) and Zelinka (1976a), and called switch graphs by Cook (2003). Zelinka, Bohdan (1974), "Polar graphs and railway traffic", Aplikace Matematiky, 19: 169–176. Zelinka, Bohdan (1976a), "Isomorphisms of polar and polarized graphs", Czechoslovak Mathematical Journal, 26 (3): 339–351, doi:10.21136/CMJ.1976.101409. Cook, Matthew (2003), "Still life theory", New Constructions in Cellular Automata, Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press, pp. 93–118.
Bidirected graphs were introduced by Edmonds & Johnson (1970), and called polarized graphs by Zelinka (1974) and Zelinka (1976a) Edmonds, Jack; Johnson, Ellis L. (1970), "Matching: a well-solved class of linear programs", Combinatorial Structures and their Applications: Proceedings of the Calgary Symposium, June 1969, New York: Gordon and Breach. Reprinted in Combinatorial Optimization — Eureka, You Shrink!, Springer-Verlag, Lecture Notes in Computer Science 2570, 2003, pp. 27–30, doi:10.1007/3-540-36478-1_3. Zelinka, Bohdan (1974), "Polar graphs and railway traffic", Aplikace Matematiky, 19: 169–176. Zelinka, Bohdan (1976a), "Isomorphisms of polar and polarized graphs", Czechoslovak Mathematical Journal, 26 (3): 339–351, doi:10.21136/CMJ.1976.101409.
Zaslavsky (1991), Section 5; Babenko (2006). Zaslavsky, Thomas (1991), "Orientation of signed graphs", European Journal of Combinatorics, 12 (4): 361–375, doi:10.1016/s0195-6698(13)80118-7. Babenko, Maxim A. (2006), "Acyclic bidirected and skew-symmetric graphs: algorithms and structure", Computer Science – Theory and Applications, Lecture Notes in Computer Science, vol. 3967, Springer-Verlag, pp. 23–34, arXiv:math/0607547, doi:10.1007/11753728_6, ISBN 978-3-540-34166-6.
Goldberg & Karzanov (1996). Goldberg, Andrew V.; Karzanov, Alexander V. (1996), "Path problems in skew-symmetric graphs", Combinatorica, 16 (3): 353–382, doi:10.1007/BF01261321.
Goldberg & Karzanov (2004); Tutte (1967). Goldberg, Andrew V.; Karzanov, Alexander V. (2004), "Maximum skew-symmetric flows and matchings", Mathematical Programming, 100 (3): 537–568, arXiv:math/0304290, doi:10.1007/s10107-004-0505-z. Tutte, W. T. (1967), "Antisymmetrical digraphs", Canadian Journal of Mathematics, 19: 1101–1117, doi:10.4153/CJM-1967-101-8.