Enumeration and maximum number of minimal connected vertex covers in graphs - Université de Lorraine Access content directly
Journal Articles European Journal of Combinatorics Year : 2018

Enumeration and maximum number of minimal connected vertex covers in graphs

Petr Golovach
Pinar Heggernes
  • Function : Author

Domains

Automatic

Dates and versions

hal-03242336 , version 1 (31-05-2021)

Identifiers

Cite

Petr Golovach, Pinar Heggernes, Dieter Kratsch. Enumeration and maximum number of minimal connected vertex covers in graphs. European Journal of Combinatorics, 2018, 68, pp.132-147. ⟨10.1016/j.ejc.2017.07.015⟩. ⟨hal-03242336⟩
16 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More