On the minimum vertex cover of generalized Petersen graphs
From MaRDI portal
Publication:2026349
DOI10.1016/j.dam.2018.12.011zbMath1464.05307OpenAlexW2910588440MaRDI QIDQ2026349
David G. L. Wang, Dannielle D. D. Jin
Publication date: 19 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.12.011
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) ⋮ Recognizing generalized Petersen graphs in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- On the power domination number of the generalized Petersen graphs
- On the hardness of approximating minimum vertex cover
- The classification of Hamiltonian generalized Petersen graphs
- A note on the generalized Petersen graphs that are also Cayley graphs
- The crossing number of \(P(N,3)\)
- Isomorphism checking of \(I\)-graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- On the domination number of the generalized Petersen graphs
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Every generalized Petersen graph has a Tait coloring
- On the crossing numbers of loop networks and generalized Petersen graphs
- Enumeration of I-graphs: Burnside does it again
- Which generalized petersen graphs are cayley graphs?
- A theorem on tait colorings with an application to the generalized Petersen graphs
- I-graphs and the corresponding configurations
- Self-dual configurations and regular graphs
This page was built for publication: On the minimum vertex cover of generalized Petersen graphs
