This shareable PDF can be hosted on any platform or network and is fully compliant with publisher copyright.
We present new complexity results and polynomially solvable special cases related to well-indumatched and perfectly well-indumatched graphs, respectively.
This page is a summary of: Graphs with maximal induced matchings of the same size, Discrete Applied Mathematics, September 2016, Elsevier,
DOI: 10.1016/j.dam.2016.08.015.
You can read the full text:
The following have contributed to this page
Security and Communication Networks
The article is about detecting Android malicious application otherwise called malware
Advances in Operations Research
System dynamics methodology has been used in many fields of study which include supply chain, project management and performance, and procurement process. The said methodology enables the researche...
International Journal of Quality & Reliability Management
This research concentrated on addressing success and failure factors regarding satisfying the needs of small to medium-sized enterprises (SMEs) when facing challenges during implementing quality ma...
