Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number

Raffaele Mosca, Paolo Nobili. Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. Graphs and Combinatorics, 31(5):1649-1658, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.