Monthira Dechacompu. 2008. Interpolation theorems for the clique, independence, vertex covering, chromatic, matching, and edge covering number of graphs. , Thammasat University; DOI : https://doi.nrct.go.th/ListDoi/listDetail?Resolve_DOI=10.14457/TU.the.2008.163
Monthira Dechacompu. (2008) Interpolation theorems for the clique, independence, vertex covering, chromatic, matching, and edge covering number of graphs . Thammasat University/Phatum Thani. DOI : https://doi.nrct.go.th/ListDoi/listDetail?Resolve_DOI=10.14457/TU.the.2008.163
Monthira Dechacompu. Interpolation theorems for the clique, independence, vertex covering, chromatic, matching, and edge covering number of graphs. . Phatum Thani:Thammasat University, 2008. DOI : https://doi.nrct.go.th/ListDoi/listDetail?Resolve_DOI=10.14457/TU.the.2008.163
Monthira Dechacompu. (2008) Interpolation theorems for the clique, independence, vertex covering, chromatic, matching, and edge covering number of graphs . Thammasat University/Phatum Thani. DOI : https://doi.nrct.go.th/ListDoi/listDetail?Resolve_DOI=10.14457/TU.the.2008.163