On the Complexity of the Dominating Induced Matching Problem in Hereditary Classes of Graphs

AuthID
 P-002-SFN
3
Author(s)
Document Type
Article
Year published
2011
Published
in DISCRETE APPLIED MATHEMATICS, ISSN: 0166-218X
Volume: 159, Issue: 7, Pages: 521-531 (11)
Indexing
Wos®
Scopus®
Crossref®18
Google Scholar®
Publication Identifiers
Scopus: 2-s2.0-79952188893
Wos: WOS:000288972200004
Source Identifiers
ISSN: 0166-218X
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

footer slogan

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service