Vertex cover at distance on \(H\)-free graphs

DOI10.1007/978-3-030-79987-8_17OpenAlexW3173980913MaRDI QIDQ2115860

Martin Milanič, Mirza Krbezlija, Clément Dallard

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_17

zbMATH Keywords

polynomial-time algorithmdichotomy\(H\)-free graph\textsf{NP}-completenessdistance-\(k\) vertex cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new characterization of \(P_k\)-free graphs
• Distance domination, guarding and covering of maximal outerplanar graphs
• Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
• PTAS for minimum \(k\)-path vertex cover in ball graph
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Complement reducible graphs
• NP-completeness of some generalizations of the maximum matching problem
• Relations between packing and covering numbers of a tree
• Structurally parameterized \(d\)-Scattered Set
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
• Linear time solvable optimization problems on graphs of bounded clique-width
• Minimum \(k\)-path vertex cover
• Partitioning a graph into small pieces with applications to path transversal
• Mim-width. III. Graph powers and generalized distance domination problems
• Distance-\(d\) independent set problems for bipartite and chordal graphs
• On the vertex \(k\)-path cover
• Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
• New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
• On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators
• Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Edge Dominating Sets in Graphs
• Polynomial algorithm for finding the largest independent sets in graphs without forks
• Reducibility among Combinatorial Problems
• Polynomial-time algorithm for Maximum Weight Independent Set on P₆-free graphs
• On distance ‐dominating and ‐independent sets in sparse graphs
• Independent Set in P₅-Free Graphs in Polynomial Time

This page was built for publication: Vertex cover at distance on \(H\)-free graphs