Independent packings in structured graphs
From MaRDI portal
Publication:2583122
Recommendations
Cites work
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1953189 (Why is no real title available?)
- scientific article; zbMATH DE number 1420226 (Why is no real title available?)
- scientific article; zbMATH DE number 1445284 (Why is no real title available?)
- scientific article; zbMATH DE number 2192124 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Algorithms for weakly triangulated graphs
- Algorithms on circular-arc graphs
- Bipartite Domination and Simultaneous Matroid Covers
- Comparability graphs and intersection graphs
- Covering and coloring polygon-circle graphs
- Efficient subgraphs packing
- Finding a maximum induced matching in weakly chordal graphs
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Graph Classes: A Survey
- Independent Sets in Asteroidal Triple-Free Graphs
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in bipartite graphs
- Induced matchings in cubic graphs
- Irredundancy in circular arc graphs
- Maximum induced matchings of random cubic graphs
- Maximum weight independent sets and cliques in intersection graphs of filaments
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- Node-Deletion Problems on Bipartite Graphs
- On generalized split graphs
- On maximum induced matchings in bipartite graphs
- On the Complexity of General Graph Factor Problems
- Optimal parallel algorithms on circular-arc graphs
- Optimizing weakly triangulated graphs
- Packing \(r\)-cliques in weighted chordal graphs
- Packing subgraphs in a graph
- Packings by cliques and by finite families of graphs
- Parallel algorithms on circular-arc graphs
- Partitioning chordal graphs into independent sets and cliques
- Recognizing graphs without asteroidal triples
- Representation of a finite graph by a set of intervals on the real line
- Stability in circular arc graphs
- The k‐piece packing problem
- The Complexity of Coloring Circular Arcs and Chords
- The \(K_r\)-packing problem
- The graphs with maximum induced matching and maximum matching the same size
- Thresholds for classes of intersection graphs
- Transitiv orientierbare Graphen
- Weakly triangulated graphs
Cited in
(48)- Dissociation in circulant graphs and integer distance graphs
- The iteration time and the general position number in graph convexities
- The maximum number of maximum dissociation sets in trees
- Maximum dissociation sets in subcubic trees
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
- A polynomial time algorithm for the triangle packing problem on interval graphs
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
- Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
- Treewidth versus clique number. II: Tree-independence number
- Analyzing the 3-path vertex cover problem in selected graph classes
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Hitting subgraphs in \(P_4\)-tidy graphs
- Approximation algorithm for minimum connected 3-path vertex cover
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- The \(k\)-path vertex cover of rooted product graphs
- The complexity of dissociation set problems in graphs
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- The weighted k-path vertex cover problem on series-parallel graphs
- The maximum number of maximum generalized 4-independent sets in trees
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number
- Induced graph packing problems
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
- Extremal vertex-degree function index with given order and dissociation number
- On spectral extrema of graphs with given order and dissociation number
- Maximum generalized 4-independent sets in subcubic trees
- Independence number and packing coloring of generalized Mycielski graphs
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
- On the vertex \(k\)-path cover
- Brambles and independent packings in chordal graphs
- Tree decompositions meet induced matchings: beyond max weight independent set
- On the maximum number of maximum dissociation sets in trees with given dissociation number
- Parameterized complexity of induced graph matching on claw-free graphs
- A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences
- On the A_-index of graphs with given order and dissociation number
- A sharp lower bound on the generalized 4-independence number
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- Packing triangles in bounded degree graphs.
- Large Induced Subgraphs via Triangulations and CMSO
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Packing $k$-Matchings and $k$-Critical Graphs
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- A \(5k\)-vertex kernel for 3-path vertex cover
- The k-separator problem: polyhedra, complexity and approximation results
This page was built for publication: Independent packings in structured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583122)
