Fan-type condition on disjoint cycles in a graph
| Autor: | Jin Yan, Junqing Cai, Shaohua Zhang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
010102 general mathematics 0102 computer and information sciences Disjoint sets 01 natural sciences Graph Theoretical Computer Science Combinatorics Type condition 010201 computation theory & mathematics Graph power Discrete Mathematics and Combinatorics Bound graph Path graph Graph toughness 0101 mathematics Graph factorization Mathematics |
| Zdroj: | Discrete Mathematics. 341:1160-1165 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2017.09.027 |
| Popis: | Let k be a positive integer. In this paper, we prove that for a graph G with at least 4 k vertices, if max { d ( x ) , d ( y ) } ≥ 2 k for any pair of nonadjacent vertices { x , y } ⊆ V ( G ) , then G contains k disjoint cycles. This generalizes the results given by Corra di and Hajnal (1963), Enomoto (1998), and Wang (1999). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect