Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/12179
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBasavaraju, M.
dc.contributor.authorHeggernes, P.
dc.contributor.authorvan, ?t, Hof, P.
dc.contributor.authorSaei, R.
dc.contributor.authorVillanger, Y.
dc.date.accessioned2020-03-31T08:38:45Z-
dc.date.available2020-03-31T08:38:45Z-
dc.date.issued2016
dc.identifier.citationJournal of Graph Theory, 2016, Vol.83, 3, pp.231-250en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12179-
dc.description.abstractAn 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.titleMaximal Induced Matchings in Triangle-Free Graphsen_US
dc.typeArticleen_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.