Raffaele Mosca - Independent sets in (P₆, diamond)-free graphs

dmtcs:473 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 1 - https://doi.org/10.46298/dmtcs.473
Independent sets in (P₆, diamond)-free graphsArticle

Authors: Raffaele Mosca 1

  • 1 Dipartimento di Scienze - Universita di Chieti-Pescara

Graphs and Algorithms

[en]
We prove that on the class of (P6,diamond)-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.

https://doi.org/10.46298/dmtcs.473
Source: HAL:hal-00988179v1
Volume: Vol. 11 no. 1
Section: Graph and Algorithms
Published on: January 1, 2009
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 495 times.
This article's PDF has been downloaded 620 times.