Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs

DOI10.1007/978-3-319-29516-9_20zbMath1476.68208arXiv1602.07504OpenAlexW2760182998MaRDI QIDQ2798235

Pinar Heggernes, Petr A. Golovach, Dieter Kratsch

Publication date: 4 April 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ Enumeration and maximum number of minimal connected vertex covers in graphs ⋮ Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ Enumerating Minimal Tropical Connected Sets

This page was built for publication: Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs