Long D3-cycles in graphs with large minimum degree

Share/Save/Bookmark

Trommel, H. (1997) Long D3-cycles in graphs with large minimum degree. [Report]

[img]
Preview
PDF
105Kb
Abstract: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. [brace not closed]
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/30525
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 141165