Longest cycles in threshold graphs

AbstractThe length of a longest cycle in a threshold graph is obtained in terms of a largest matching in a specially structured bipartite graph. It can be computed in linear time. As a corollary, Hamiltonian threshold graphs are characterized. This characterization yields Golumbic's characterization and sharpens Minty's characterization. It is also shown that a threshold graph has cycles of length 3, …, l where l is the length of a longest cycle

Report of the session on algorithms for special classes of combinatorial optimization problems

No abstract