Home » Author index

Jackson, Bill


Graph Theory » Directed Graphs

Hamilton cycle in small d-diregular graphs ★★

Author(s): Jackson

An directed graph is $ k $-diregular if every vertex has indegree and outdegree at least $ k $.

Conjecture   For $ d >2 $, every $ d $-diregular oriented graph on at most $ 4d+1 $ vertices has a Hamilton cycle.

Keywords:

Posted by fhavet
updated March 8th, 2013
add new comment
Graph Theory » Directed Graphs

Long directed cycles in diregular digraphs ★★★

Author(s): Jackson

Conjecture   Every strong oriented graph in which each vertex has indegree and outdegree at least $ d $ contains a directed cycle of length at least $ 2d+1 $.

Keywords:

Posted by fhavet
updated March 1st, 2013
add new comment
Syndicate content