论文信息 - On circuits through five edges

On circuits through five edges

Abstract Let L be a set of five independent edges in a 5-connected graph G . This paper proves that G has a circuit containing the edges of L if and only if G - L is connected. This is a specific case of a conjecture of Lovasz and Woodall.

Daniel P. Sanders | Daniel P. Sanders

[1] Carsten Thomassen,et al. Circuits through specified edges , 1982, Discret. Math..

[2] Alexander Schrijver,et al. Paths, Flows, and VLSI-Layout , 1990 .

[3] Ervin Győri,et al. Any four independent edges of a 4-connected graph are contained in a circuit , 1985 .

[4] G. Dirac. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .

[5] Carsten Thomassen,et al. Cycles through four edges in 3-connected cubic graphs , 1985, Graphs Comb..

[6] Carsten Thomassen. Note on circuits containing specified edges , 1977, J. Comb. Theory, Ser. B.

[7] Douglas R. Woodall,et al. Circuits containing specified edges , 1977, J. Comb. Theory, Ser. B.