Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/12179
Title: Maximal Induced Matchings in Triangle-Free Graphs
Authors: Basavaraju, M.
Heggernes, P.
van, ?t, Hof, P.
Saei, R.
Villanger, Y.
Issue Date: 2016
Citation: Journal of Graph Theory, 2016, Vol.83, 3, pp.231-250
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.
URI: http://idr.nitk.ac.in/jspui/handle/123456789/12179
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.