Connected vertex cover for \((sP_1+P_5)\)-free graphs

DOI10.1007/978-3-030-00256-5_23zbMath1436.68244arXiv1712.08362OpenAlexW3016408270MaRDI QIDQ5915592

Giacomo Paesani, Matthew Johnson, Daniël Paulusma

Publication date: 22 November 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08362

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Unnamed Item ⋮ Connected vertex cover for \((sP_1+P_5)\)-free graphs

This page was built for publication: Connected vertex cover for \((sP_1+P_5)\)-free graphs