Premium
Covering vertices by cycles
Author(s) -
Kouider Mekkia
Publication year - 1994
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.3190180802
Subject(s) - mathematics , combinatorics , conjecture , graph , discrete mathematics
“If G is a 2‐connected graph with n vertices and minimum degree d, then the vertices of G can be covered by less than n/d cycles. This settles a conjecture of Enomoto, Kaneko and Tuza for 2‐connected graphs.”