Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
| dc.creator | Tserunyan, A. V. | |
| dc.date | 2007-12-06 | |
| dc.date.accessioned | 2026-07-07T12:47:46Z | |
| dc.date.available | 2026-07-07T12:47:46Z | |
| dc.description | For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is known that this relation does not exceed 5/4 for any graph. We characterize the class of graphs for which this relation is precisely 5/4. Our characterization implies that these graphs contain a spanning subgraph, every component of which is the minimal graph of this class. | |
| dc.description | 33 pages, 10 figures | |
| dc.identifier | https://arxiv.org/abs/0712.1014 | |
| dc.identifier | http://arxiv.org/abs/0712.1014 | |
| dc.identifier | Discrete Mathematics 309 (2009) 693--713 | |
| dc.identifier | doi:10.1016/j.disc.2008.01.004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/221834 | |
| dc.subject | Discrete Mathematics | |
| dc.title | Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings | |
| dc.type | text |