External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma. Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. In Andreas Brandstädt, Ekkehard Köhler, Klaus Meer, editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Volume 11159 of Lecture Notes in Computer Science, pages 279-291, Springer, 2018. [doi]

Authors

Matthew Johnson 0002

This author has not been identified. Look up 'Matthew Johnson 0002' in Google

Giacomo Paesani

This author has not been identified. Look up 'Giacomo Paesani' in Google

Daniël Paulusma

This author has not been identified. Look up 'Daniël Paulusma' in Google
runs on