Longest cycles in 3-connected graphs contain three contractible edges.

Nathaniel Dean Robert L. Hemminger Katsuhiro Ota

Published in: J. Graph Theory (1989)

Keyphrases

connected graphs
directed graph
markov random field
directed acyclic graph
data sets
edge detector
image structure
real time
information systems
image processing
three dimensional
database systems
upper bound
image restoration
neighboring pixels