543 research outputs found

    Maximal induced matchings in triangle-free graphs

    Full text link
    An induced matching in a graph is a set of edges whose endpoints induce a 11-regular subgraph. It is known that any nn-vertex graph has at most 10n/5≈1.5849n10^{n/5} \approx 1.5849^n maximal induced matchings, and this bound is best possible. We prove that any nn-vertex triangle-free graph has at most 3n/3≈1.4423n3^{n/3} \approx 1.4423^n maximal induced matchings, and this bound is attained by any disjoint union of copies of the complete bipartite graph K3,3K_{3,3}. Our result implies that all maximal induced matchings in an nn-vertex triangle-free graph can be listed in time O(1.4423n)O(1.4423^n), yielding the fastest known algorithm for finding a maximum induced matching in a triangle-free graph.Comment: 17 page

    Between proper and strong edge-colorings of subcubic graphs

    Full text link
    In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-coloring in which the edges of every color form an induced matching. We consider intermediate types of edge-colorings, where edges of some colors are allowed to form matchings, and the remaining form induced matchings. Our research is motivated by the conjecture proposed in a recent paper of Gastineau and Togni on S-packing edge-colorings (On S-packing edge-colorings of cubic graphs, Discrete Appl. Math. 259 (2019), 63-75) asserting that by allowing three additional induced matchings, one is able to save one matching color. We prove that every graph with maximum degree 3 can be decomposed into one matching and at most 8 induced matchings, and two matchings and at most 5 induced matchings. We also show that if a graph is in class I, the number of induced matchings can be decreased by one, hence confirming the above-mentioned conjecture for class I graphs

    Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

    Full text link
    A bipartite graph G=(U,V,E)G=(U,V,E) is convex if the vertices in VV can be linearly ordered such that for each vertex u∈Uu\in U, the neighbors of uu are consecutive in the ordering of VV. An induced matching HH of GG is a matching such that no edge of EE connects endpoints of two different edges of HH. We show that in a convex bipartite graph with nn vertices and mm weighted edges, an induced matching of maximum total weight can be computed in O(n+m)O(n+m) time. An unweighted convex bipartite graph has a representation of size O(n)O(n) that records for each vertex u∈Uu\in U the first and last neighbor in the ordering of VV. Given such a compact representation, we compute an induced matching of maximum cardinality in O(n)O(n) time. In convex bipartite graphs, maximum-cardinality induced matchings are dual to minimum chain covers. A chain cover is a covering of the edge set by chain subgraphs, that is, subgraphs that do not contain induced matchings of more than one edge. Given a compact representation, we compute a representation of a minimum chain cover in O(n)O(n) time. If no compact representation is given, the cover can be computed in O(n+m)O(n+m) time. All of our algorithms achieve optimal running time for the respective problem and model. Previous algorithms considered only the unweighted case, and the best algorithm for computing a maximum-cardinality induced matching or a minimum chain cover in a convex bipartite graph had a running time of O(n2)O(n^2)

    Efficient edge domination in regular graphs

    Get PDF
    An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complet
    • …
    corecore