"Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs."

Matthew Johnson, Giacomo Paesani, Daniël Paulusma (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-030-00256-5_23

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/0002PP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/0002PP18
Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG 2018: 279-291

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.