Long Cycles in 3-Connected Graphs with Bounded Degrees

Authors

Guantao Chen, Georgia State University

Document Type

Lecture

Publication Date

10-28-2010

Abstract

In 1993 Jackson and Wormald conjectured that if G is a 3-connected n-vertex graph with maximum degree d 2'. 4 then G has a cycle of length O(n10gd-1 2). In this talk, I will report progresses on this conjecture and related problems.

Relational Format

presentation

Recommended Citation

Chen, Guantao, "Long Cycles in 3-Connected Graphs with Bounded Degrees" (2010). Combinatorics Seminar. 74.
https://egrove.olemiss.edu/math_combinatorics/74