Consequences of an algorithm for bridged graphs

Citations of this article
Mendeley users who have this article in their library.


Chepoi showed that every breadth first search of a bridged graph produces a cop-win ordering of the graph. We note here that Chepoi's proof gives a simple proof of the theorem that G is bridged if and only if G is cop-win and has no induced cycle of length four or five, and that this characterization together with Chepoi's proof reduces the time complexity of bridged graph recognition. Specifically, we show that bridged graph recognition is equivalent to (C4,C5 )-free graph recognition, and reduce the best known time complexity from O(n4) to O(n3.376 ). © 2003 Elsevier B.V. All rights reserved.

Author supplied keywords




Le, V. B., & Spinrad, J. (2004). Consequences of an algorithm for bridged graphs. Discrete Mathematics, 280(1–3), 271–274.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free