Minimum k-path vertex cover

Discrete Applied Mathematics

Volumn 159, Issue 12, 2011, Pages 1189-1195

  Brešar, Boštjan ^a,b   Kardoš, František ^c   Katrenič, Ján ^c   Semanišin, Gabriel ^c  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

^c P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Algorithm; Dissociation number; NP complete; Path; Path vertex cover; Vertex cover

Indexed keywords

CARDINALITIES; GRAPH G; LINEAR TIME; NP COMPLETE; NP-HARD; PATH; PATH VERTEX COVER; UPPER BOUND; VERTEX COVER;

COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 79957805348     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.04.008     Document Type: Article

References (32)

1. J. Akiyama, H. Era, S.V. Gervacio, and M. Watanabe Path chromatic numbers of graphs J. Graph Theory 13 1989 571 573
2. M.O. Albertson, and D.M. Berman The acyclic chromatic number Proceedings of the Seventh Southeastern Conference on Combinatorics, Graph Theory, and Computing Congr. Numer. vol. 17 1976 51 69 Utilitas Math.
3. N. Alon Transversal numbers of uniform hypergraphs Graphs Combin. 6 1990 1 4
4. S. Bau, L.W. Beineke, and R.C. Vandell Decycling snakes Congr. Numer. 134 1998 79 87
5. R. Boliac, K. Cameron, and V.V. Lozin On computing the dissociation number and the induced matching number of bipartite graphs Ars Combin. 72 2004 241 253 (Pubitemid 41453457)
6. Y. Caro, New results on the independence number, Technical Report, Tel-Aviv University, 1979.
7. T. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 The MIT Press
8. B. Courcelle The monadic second-order logic of graphs. I. Recognizable sets of finite graphs Inform. and Comput. 85 1990 12 75 (Pubitemid 20680563)
9. L.J. Cowen, C.E. Jesurum, Coloring with defects, DIMACS Technical Report 95-25, 1995.
10. I. Dinur, and S. Safra On the hardness of approximating minimum vertex cover Ann. of Math. 162 2005 439 485 (Pubitemid 43034608)
11. P. Festa, P.M. Pardolos, M.G.C. Resende, Feedback set problems, AT&T labs. Research Technical Report TR 99.2.2, 1999, Encyclopedia of Optimization, Kluwer Academic Publisher, Dordrecht, Netherlands, 2000.
12. M. Frick, and F. Bullock Detour chromatic number Discuss. Math. Graph Theory 21 2001 283 291
13. D. Gollmann Protocol analysis for concrete environments EUROCAST 2005 LNCS vol. 3643 2005 Springer Heidelberg 365 372
14. F. Gring, J. Harant, D. Rautenbach, and I. Schiermeyer On F-independence in graphs Discuss. Math. Graph Theory 29 2 2009 377 383
15. J. Harant, M.A. Henning, D. Rautenbach, and I. Schiermeyer Independence number in graphs of maximum degree three Discrete Math. 308 2008 5829 5833
16. J. Harant, and I. Schiermeyer On the independence number of a graph in terms of order and size Discrete Math. 232 2001 131 138 (Pubitemid 33660381)
17. C.C. Heckman On the tightness of the 5/14 independence ratio Discrete Math. 308 2008 3169 3179
18. C.C. Heckman, and R. Thomas A new proof of the independence ratio of triangle-free cubic graphs Discrete Math. 233 2001 233 237 (Pubitemid 33660408)
19. Y. Jinjiang Computational complexity of (2, 2) path chromatic number problem Appl. Math. J. Chinese Univ. Ser. B 10B 1995 83 88
20. G. Johns, and F. Saba On the path-chromatic number of a graph Ann. New York Acad. Sci. 576 1989 275 280 (Pubitemid 20342557)
21. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computations 1972 Plenum Press New York 85 104
22. L. Lovsz On decompositions of graphs Studia Sci. Math. Hungar. 1 1966 237 238
23. C. Lwenstein, A.S. Pedersen, D. Rautenbach, F. Regen, Independence, odd girth, and average degree, J. Graph Theory, n a. doi:10.1002/jgt.20518.
24. C.M. Mynhardt, and I. Broere Generalized colorings of graphs Graph Theory with Applications to Algorithms and Computer Science 1985 John Wiley & Sons, Inc. New York, NY 583 594
25. M. Novotn Design and analysis of a generalized canvas protocol Proceedings of WISTP 2010 LNCS vol. 6033 2010 Springer-Verlag 106 121
26. M. Novotn Formal analysis of security protocols for wireless sensor networks Tatra Mt. Math. Publ. 47 2010 81 97
27. S. Thomass, and A. Yeo Total domination of graphs and small transversals of hypergraphs Combinatorica 27 2007 473 487
28. H. Vogt, Integrity preservation for communication in sensor networks. Technical Report 434, Institute for Pervasive Computing, ETH Zrich, 2004.
29. V.K. Wei, A lower bound on the stability number of a simple graph, Technical Memorandum, TM 81-11217-9, Bell Laboratories, 1981.
30. D.B. West Introduction to Graph Theory 1996 Prentice Hall
31. k ) time Inform. Process. Lett. 109 2009 315 318
32. M. Yannakakis Node-deletion problems on bipartite graphs SIAM J. Comput. 10 1981 310 327