On a 2-factor with a specified edge in a graph satisfying the Ore condition
暂无分享,去创建一个
[1] Paul Erdös,et al. A note on Hamiltonian circuits , 1972, Discret. Math..
[2] P. Justesen,et al. On Independent Circuits in Finite Graphs and a Conjecture of Erdös and Pósa. , 1988 .
[3] Ralph J. Faudree,et al. Degree conditions for 2-factors , 1997 .
[4] Hikoe Enomoto,et al. On the Existence of Disjoint Cycles in a Graph , 1998, Comb..
[5] Hong Wang,et al. On the maximum number of independent cycles in a graph , 1999, Discret. Math..
[6] Hong Wang,et al. Vertex-Disjoint Cycles Containing Specified Edges , 2000, Graphs Comb..