Journal ArticleOPEN ACCESS

On Generalizations of Matching-covered Graphs

European Journal of Combinatorics (2001) 22(6) 865-877
DOI: 10.1006/eujc.2001.0505
5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Structural results for extensions of matching-covered graphs are presented in this paper. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Szigeti, Z. (2001). On Generalizations of Matching-covered Graphs. European Journal of Combinatorics, 22(6), 865–877. https://doi.org/10.1006/eujc.2001.0505

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