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]
@article{MoscaN15,
title = {Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number},
author = {Raffaele Mosca and Paolo Nobili},
year = {2015},
doi = {10.1007/s00373-014-1483-4},
url = {http://dx.doi.org/10.1007/s00373-014-1483-4},
researchr = {https://researchr.org/publication/MoscaN15},
cites = {0},
citedby = {0},
journal = {Graphs and Combinatorics},
volume = {31},
number = {5},
pages = {1649-1658},
}