3-path vertex cover and dissociation number of hexagonal graphs
From MaRDI portal
Publication:5866250
DOI10.2298/AADM201009007EzbMath1499.05514OpenAlexW4226187073MaRDI QIDQ5866250
Rija Erveš, Aleksandra Tepeh Horvat
Publication date: 13 June 2022
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm201009007e
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
- Kernelization of the 3-path vertex cover problem
- On the weighted \(k\)-path vertex cover problem
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- Simpler multicoloring of triangle-free hexagonal graphs
- Maximum induced matching of hexagonal graphs
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- On the \(k\)-path vertex cover of some graph products
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- Hitting subgraphs in \(P_4\)-tidy graphs
- Minimum \(k\)-path vertex cover
- The complexity of dissociation set problems in graphs
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
- The \(k\)-path vertex cover of rooted product graphs
- The vertex cover \(P_3\) problem in cubic graphs
- On the vertex \(k\)-path cover
- On F-independence in graphs
- Node-Deletion Problems on Bipartite Graphs
- 3-path vertex cover and dissociation number of hexagonal graphs
