Circular flow on signed graphs
暂无分享,去创建一个
[1] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[2] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .
[3] Rui Xu,et al. On flows in bidirected graphs , 2005, Discret. Math..
[4] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .
[5] Luis A. Goddyn,et al. The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four , 2002, Comb..
[6] Michael Tarsi,et al. On (k, d)-colorings and fractional nowhere-zero flows , 1998 .
[7] Cun-Quan Zhang,et al. On (k, d)-colorings and fractional nowhere-zero flows , 1998, J. Graph Theory.
[8] Katta G. Murty,et al. On KΔ , 1986, Discret. Appl. Math..
[9] Xuding Zhu,et al. Recent Developments in Circular Colouring of Graphs , 2006 .
[10] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..
[11] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[12] Thomas Zaslavsky. Signed graphs , 1982, Discret. Appl. Math..
[13] A. Khelladi,et al. Nowhere-zero integral chains and flows in bidirected graphs , 1987, J. Comb. Theory, Ser. B.
[14] F. Jaeger. ON CIRCULAR FLOWS IN GRAPHS , 1984 .
[15] Thomas Zaslavsky. Orientation of Signed Graphs , 1991, Eur. J. Comb..
[16] André Bouchet,et al. Nowhere-zero integral flows on a bidirected graph , 1983, J. Comb. Theory B.