On the complexity of recognizing S-composite and S-prime graphs

Marc Hellmuth. On the complexity of recognizing S-composite and S-prime graphs. Discrete Applied Mathematics, 161(7-8):1006-1013, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.