On removable even circuits in graphs

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

Abstract

Let G be a connected graph with minimum degree at least 3. We prove that there exists an even circuit C in G such that G-E(C) is either connected or contains precisely two components one of which is isomorphic to a 1-bond. We further prove sufficient conditions for there to exist an even circuit C in a 2-connected simple graph G such that G-E(C) is 2-connected. As a consequence of this, we obtain sufficient conditions for there to exist an even circuit C in a 2-connected graph G for which G-E(C) is 2-connected. © 2004 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Sinclair, P. A. (2004). On removable even circuits in graphs. Discrete Mathematics, 286(3), 177–184. https://doi.org/10.1016/j.disc.2004.03.012

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