On computing the minimum 3-path vertex cover and dissociation number of graphs期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On computing the minimum 3-path vertex cover and dissociation number of graphs

Authors:	František KardošJán Katreni? Ingo Schiermeyer

Affiliation:	^a Institute of Mathematics, P.J. Šafárik University, Košice, Slovakia ^b Institute of Computer Science, P.J. Šafárik University, Košice, Slovakia ^c Institut für Diskrete Mathematik und Algebra, TU-Freiberg, Germany

Abstract:

Keywords:	Path vertex cover Dissociation number Approximation
本文献已被 ScienceDirect 等数据库收录！