### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | Universiteit Twente |

Number of pages | 11 |

ISBN (Print) | 0169-2690 |

Publication status | Published - 1997 |

### Publication series

Name | Memorandum / University of Twente, Faculty of Applied Mathematics |
---|---|

Publisher | Universiteit Twente |

No. | 1368 |

### Keywords

- METIS-141165
- IR-30525

### Cite this

*Long D3-cycles in graphs with large minimum degree*. (Memorandum / University of Twente, Faculty of Applied Mathematics; No. 1368). Enschede: Universiteit Twente.

}

*Long D3-cycles in graphs with large minimum degree*. Memorandum / University of Twente, Faculty of Applied Mathematics, no. 1368, Universiteit Twente, Enschede.

**Long D3-cycles in graphs with large minimum degree.** / Trommel, H.

Research output: Book/Report › Report › Professional

TY - BOOK

T1 - Long D3-cycles in graphs with large minimum degree

AU - Trommel, H.

N1 - Memorandum fac. TW nr 1368

PY - 1997

Y1 - 1997

N2 - It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.

AB - It is shown that if G is a 2-connected graph on n vertices, with minimum degree such that n≤4δ−6, and with a maximum independent set of cardinality , then G contains a cycle of length at least min {n,n+2δ−2α−2g or G ε F, where F denotes a well-known class of nonhamiltonian graphs of connectivity 2.

KW - METIS-141165

KW - IR-30525

M3 - Report

SN - 0169-2690

T3 - Memorandum / University of Twente, Faculty of Applied Mathematics

BT - Long D3-cycles in graphs with large minimum degree

PB - Universiteit Twente

CY - Enschede

ER -