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.



Related Items (33)

A polynomial time algorithm for strong edge coloring of partial \(k\)-treesUnnamed ItemUnnamed ItemUnnamed ItemNeighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographsUnnamed ItemInduced matchings in asteroidal triple-free graphsA min-max property of chordal bipartite graphs with applicationsInteger Programming Formulations and Benders Decomposition for the Maximum Induced Matching ProblemWell-indumatched Trees and Graphs of Bounded GirthNew results on induced matchingsApproximability results for the maximum and minimum maximal induced matching problemsApproximating weighted induced matchingsOn the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphsLinear time algorithms for generalized edge dominating set problemsOn the approximability of the maximum induced matching problemOn distance-3 matchings and induced matchingsGeneralized subgraph-restricted matchings in graphsMaximum induced matching of hexagonal graphsThe induced matching and chain subgraph cover problems for convex bipartite graphsNew kernels for several problems on planar graphsFinding a maximum induced matching in weakly chordal graphsMaximum induced matchings for chordal graphs in linear timeThe parameterized complexity of the induced matching problemSome results on graphs without long induced pathsMaximum induced matching problem on hhd-free graphsOn Distance-3 Matchings and Induced MatchingsBrambles and independent packings in chordal graphsOn maximum induced matchings in bipartite graphsIndependent packings in structured graphsA Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted TreeSquares of Intersection Graphs and Induced MatchingsModerately exponential time algorithms for the maximum induced matching problem




This page was built for publication: