scientific article
From MaRDI portal
Publication:3139292
zbMath0786.05065MaRDI QIDQ3139292
Renu C. Laskar, Gerd H. Fricke
Publication date: 11 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (33)
A polynomial time algorithm for strong edge coloring of partial \(k\)-trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ Unnamed Item ⋮ Induced matchings in asteroidal triple-free graphs ⋮ A min-max property of chordal bipartite graphs with applications ⋮ Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ New results on induced matchings ⋮ Approximability results for the maximum and minimum maximal induced matching problems ⋮ Approximating weighted induced matchings ⋮ On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs ⋮ Linear time algorithms for generalized edge dominating set problems ⋮ On the approximability of the maximum induced matching problem ⋮ On distance-3 matchings and induced matchings ⋮ Generalized subgraph-restricted matchings in graphs ⋮ Maximum induced matching of hexagonal graphs ⋮ The induced matching and chain subgraph cover problems for convex bipartite graphs ⋮ New kernels for several problems on planar graphs ⋮ Finding a maximum induced matching in weakly chordal graphs ⋮ Maximum induced matchings for chordal graphs in linear time ⋮ The parameterized complexity of the induced matching problem ⋮ Some results on graphs without long induced paths ⋮ Maximum induced matching problem on hhd-free graphs ⋮ On Distance-3 Matchings and Induced Matchings ⋮ Brambles and independent packings in chordal graphs ⋮ On maximum induced matchings in bipartite graphs ⋮ Independent packings in structured graphs ⋮ A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree ⋮ Squares of Intersection Graphs and Induced Matchings ⋮ Moderately exponential time algorithms for the maximum induced matching problem
This page was built for publication:
