On circuits through five edges

Discrete Mathematics

Volumn 159, Issue 1-3, 1996, Pages 199-215

  Sanders, Daniel P ^a,b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008385784     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00079-C     Document Type: Article

References (9)

1. R.E.L. Aldred, D.A. Holton and C. Thomassen, Cycles through four edges in 3-connected cubic graphs, Graphs and Combin. 1 (1985) 7-11.
2. G.A. Dirac, In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen, Math. Nachr. 22 (1960) 61-85.
3. P.L. Erdos and E. Gyori, Any four independent edges of a 4-connected graph are contained in a circuit, Acta Math. Hungar. 46 (1985) 311-313.
4. R. Häggkvist and C. Thomassen, Circuits through specified edges, Discrete Math. 41 (1982) 29-34.
5. M.V. Lomonosov, Cycles through prescribed elements in a graph, in: Korte, Lovász, Promel and Schrijver, eds. Paths, Flows, and VLSI Layout (Springer, Berlin, 1990) 215-234.
6. L. Lovász, Problem 5, Period. Math. Hungar. 4 (1974) 82.
7. N. Robertson, unpublished manuscript.
8. C. Thomassen, Note on circuits containing specified edges, J. Combin. Theory Ser. B 22 (1977) 279-280.
9. D.R. Woodall, Circuits containing specified edges, J. Combin. Theory Ser. B 22 (1977) 274-278.