Identifying vertex covers in graphs

zbMath1266.05118MaRDI QIDQ1953340

Anders Yeo, Michael A. Henning

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p32

zbMATH Keywords

transversalvertex coveridentifying vertex cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Fixed-parameter tractable algorithms for tracking shortest paths ⋮ Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs

This page was built for publication: Identifying vertex covers in graphs