Subject
Discrete Mathematics and Combinatorics,Computational Theory and Mathematics,Theoretical Computer Science
Reference8 articles.
1. Theorie der endlichen und unendlichen Graphen;König,1936
2. Monotone Networks;Minty,1960
3. Solving Steady-State Nonlinear Networks of “Monotone” Elements;Minty;I.R.E. Trans. Circuit Theory,1961
4. A Theorem on n-Coloring the Points of a Linear Graph;Minty;Amer. Math. Monthly,1962
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Edge Colorings and Circular Flow Numbers of Regular Graphs;Journal of Graph Theory;2014-05-01
2. Further Topics in Graph Coloring;Discrete Mathematics and Its Applications;2013-11-26
3. Orientations and Flows;Graph Coloring Problems;2011-10-28
4. On the strong circular 5-flow conjecture;Journal of Graph Theory;2006
5. Polynomials Associated with Nowhere-Zero Flows;Journal of Combinatorial Theory, Series B;2002-03