Covering cycles and k-term degree sums

Combinatorica

Volumn 16, Issue 3, 1996, Pages 407-412

  Kouider, Mekkia ^a   Lonc, Zbigniew ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037941979     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01261324     Document Type: Article

References (5)

1. G. A. DIRAC: Some theorems on abstract graphs, Proc. London Math. Soc., 2 (1952), 69-81.
2. H. ENOMOTO, A. KANEKO, M. KOUIDER, and ZS. TUZA: Degree sums and covering cycles, Journal of Graph Theory, 20 (1995), 419-422.
3. 3-factors and covering cycles in graphs of minimum degree n/3, Colloquia Mathernatica Societatis János Bolyai 52. Combinatorics, Eger (Hungary), North Holland (1988), 213-220.
4. M. KOUIDER: Covering vertices by cycles, Journal of Graph Theory, 18 (1994), 757-776.
5. O. ORE: Note on Hamiltonian circuits, Amer. Math. Monthly, 67 (1960), 55.