Parameterized complexity of induced graph matching on claw-free graphs
From MaRDI portal
Publication:487013
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Data structures (68P05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 139780 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- scientific article; zbMATH DE number 7053262 (Why is no real title available?)
- A Problem Kernelization for Graph Packing
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Algorithms – ESA 2005
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Claw-free graphs---a survey
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. II: Non-orientable prismatic graphs
- Claw-free graphs. III: Circular interval graphs
- Claw-free graphs. IV: Decomposition theorem
- Claw-free graphs. V. Global structure
- Claw-free graphs. VI: Colouring
- Claw-free graphs. VII. Quasi-line graphs
- Color-coding
- Coloring quasi-line graphs
- Divide-and-Color
- Dominating set is fixed parameter tractable in claw-free graphs
- Efficient graph representations
- Faster fixed-parameter tractable algorithms for matching and packing problems
- 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
- Independent packings in structured graphs
- Induced disjoint paths in claw-free graphs
- Induced subgraph isomorphism on interval and proper interval graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Kernelization of packing problems
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Looking at the stars
- Normal Helly circular-arc graphs and its subclasses
- On the Complexity of General Graph Factor Problems
- On the parameterized complexity of multiple-interval graph problems
- On the recognition of fuzzy circular interval graphs
- Parameterized complexity of finding regular induced subgraphs
- Parameterized complexity of induced \(H\)-matching on claw-free graphs
- Restricted circular-arc graphs and clique cycles
- The structure of claw-free graphs
Cited in
(17)- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
- Declawing a graph: polyhedra and branch-and-cut algorithms
- On the parameterized complexity of the acyclic matching problem
- Parameterized complexity of independent set in \(H\)-free graphs
- Parameterized complexity of independent set in H-free graphs
- Induced disjoint paths in claw-free graphs
- Parameterized complexity of induced \(H\)-matching on claw-free graphs
- Polynomial kernelization for removing induced claws and diamonds
- Induced disjoint paths in claw-free graphs
- Disconnected cuts in claw-free graphs
- The parameterized complexity of the induced matching problem
- scientific article; zbMATH DE number 7080199 (Why is no real title available?)
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Polynomial kernelization for removing induced claws and diamonds
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Correction to: ``A connection between sports and matroids: how many teams can we beat?
- scientific article; zbMATH DE number 7204318 (Why is no real title available?)
This page was built for publication: Parameterized complexity of induced graph matching on claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487013)
