Characterization of a class of graphs related to pairs of disjoint matchings

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

Abstract

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the ratio of the cardinalities of a maximum matching and the largest matching in those pairs. It is known that for any graph frac(5, 4) is the tight upper bound for this ratio. We characterize the class of graphs for which it is precisely frac(5, 4). Our characterization implies that these graphs contain a spanning subgraph, every connected component of which is the minimal graph of this class. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Tserunyan, A. (2009). Characterization of a class of graphs related to pairs of disjoint matchings. Discrete Mathematics, 309(4), 693–713. https://doi.org/10.1016/j.disc.2008.01.004

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