Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/12179Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Basavaraju, M. | |
| dc.contributor.author | Heggernes, P. | |
| dc.contributor.author | van, ?t, Hof, P. | |
| dc.contributor.author | Saei, R. | |
| dc.contributor.author | Villanger, Y. | |
| dc.date.accessioned | 2020-03-31T08:38:45Z | - |
| dc.date.available | 2020-03-31T08:38:45Z | - |
| dc.date.issued | 2016 | |
| dc.identifier.citation | Journal of Graph Theory, 2016, Vol.83, 3, pp.231-250 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12179 | - |
| dc.description.abstract | An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every n-vertex graph has at most (Formula presented.) maximal induced matchings, and this bound is the best possible. We prove that every n-vertex triangle-free graph has at most (Formula presented.) maximal induced matchings; this bound is attained by every disjoint union of copies of the complete bipartite graph K3, 3. Our result implies that all maximal induced matchings in an n-vertex triangle-free graph can be listed in time (Formula presented.), yielding the fastest known algorithm for finding a maximum induced matching in a triangle-free graph. 2015 Wiley Periodicals, Inc. | en_US |
| dc.title | Maximal Induced Matchings in Triangle-Free Graphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.