Restricted cycle factors and arc-decompositions of digraphs
暂无分享,去创建一个
[1] Bodo Manthey,et al. Computing Cycle Covers without Short Cycles , 2001, ESA.
[2] Jørgen Bang-Jensen,et al. On the problem of finding disjoint cycles and dicycles in a digraph , 2011, Comb..
[3] William McCuaig,et al. Intercyclic digraphs , 1991, Graph Structure Theory.
[4] Jirí Fiala. NP completeness of the edge precoloring extension problem on bipartite graphs , 2003, J. Graph Theory.
[5] David Hartvigsen,et al. Finding maximum square-free 2-matchings in bipartite graphs , 2006, J. Comb. Theory B.
[6] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[7] Jørgen Bang-Jensen,et al. Vertex-disjoint directed and undirected cycles in general digraphs , 2011, J. Comb. Theory, Ser. B.
[8] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[9] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[10] Carl Johan Casselgren. On avoiding some families of arrays , 2012, Discret. Math..