A note on interconnecting matchings in graphs

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

Abstract

We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a recent extension of the Matroid intersection theorem due to Aharoni and Berger. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs. © 2006 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Kaiser, T. (2006). A note on interconnecting matchings in graphs. Discrete Mathematics, 306(18), 2245–2250. https://doi.org/10.1016/j.disc.2006.05.011

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