Minimum <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-path vertex cover-Reference-Cited by-同舟云学术

Minimum k-path vertex cover

Author:

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

Funder

Ministry of Science and Technology of Slovenia

Slovak Research and Development Agency

Agency of the Slovak Ministry of Education for the Structural Funds of the EU

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference32 articles.

2. The acyclic chromatic number;Albertson,1976

4. Decycling snakes;Bau;Congr. Numer.,1998

5. On computing the dissociation number and the induced matching number of bipartite graphs;Boliac;Ars Combin.,2004

Cited by 117 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On kernels for d-path vertex cover;Journal of Computer and System Sciences;2024-09

3. Fast Query Answering by Labeling Index on Uncertain Graphs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13