Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/112528
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Caro, Yair | - |
dc.contributor.author | Lauri, Josef | - |
dc.contributor.author | Zarb, Christina | - |
dc.date.accessioned | 2023-08-23T06:29:15Z | - |
dc.date.available | 2023-08-23T06:29:15Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | Caro, Y., Lauri, J., & Zarb, C. (2017). Two short proofs of the perfect forest theorem. Theory & Applications Of Graphs, 4(1), 4. | en_GB |
dc.identifier.uri | https://www.um.edu.mt/library/oar/handle/123456789/112528 | - |
dc.description.abstract | A perfect forest is a spanning forest of a connected graph G, all of whose components are induced subgraphs of G and such that all vertices have odd degree in the forest. A perfect forest can be thought of as a generalization of a perfect matching since, in a matching, all components are trees on one edge. Scott first proved the Perfect Forest Theorem, namely, that every connected graph of even order has a perfect forest. Gutin then gave another proof using linear algebra. We give two very short proofs of the Perfect Forest Theorem which use only elementary notions from graph theory. Both of our proofs yield polynomial time algorithms for finding a perfect forest in a connected graph of even order. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | Georgia Southern University | en_GB |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_GB |
dc.subject | Perfect graphs | en_GB |
dc.subject | Graph theory | en_GB |
dc.subject | Graphic methods | en_GB |
dc.subject | Mathematics -- Charts, diagrams, etc. | en_GB |
dc.title | Two short proofs of the Perfect Forest Theorem | en_GB |
dc.type | article | en_GB |
dc.rights.holder | The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder. | en_GB |
dc.description.reviewed | peer-reviewed | en_GB |
dc.identifier.doi | 10.20429/tag.2017.040104 | - |
dc.publication.title | Theory & Applications Of Graphs | en_GB |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Two_short_proofs_of_the_Perfect_Forest_Theorem_2017.pdf Restricted Access | 223 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.