Premium
Covering a graph with cycles
Author(s) -
Wang Hong
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200209
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
Let k and n be two integers such that k ≥ 0 and n ≥ 3( k + 1). Let G be a graph of order n with minimum degree at least ⌈( n + k )/2⌉. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.