Liang, Zhihe; Fu, Hung-Lin On ascending subgraph decomposition of graphs. (English) Zbl 1495.05258 J. Discrete Math. Sci. Cryptography 20, No. 5, 1135-1149 (2017). MSC: 05C70 PDFBibTeX XMLCite \textit{Z. Liang} and \textit{H.-L. Fu}, J. Discrete Math. Sci. Cryptography 20, No. 5, 1135--1149 (2017; Zbl 1495.05258) Full Text: DOI
Joseph, J. Paulraj; Rosalin, S. Induced cycle path number of graphs. (English) Zbl 1495.05256 J. Discrete Math. Sci. Cryptography 18, No. 6, 887-901 (2015). MSC: 05C70 05C38 05C30 PDFBibTeX XMLCite \textit{J. P. Joseph} and \textit{S. Rosalin}, J. Discrete Math. Sci. Cryptography 18, No. 6, 887--901 (2015; Zbl 1495.05256) Full Text: DOI
Yu, Jiguo; Zheng, Yongmeng; Liu, Guizhen; Zhang, Yonghong 2-induced-matching partition problem and 2-induced-matching cover problem of graphs with diameter 5 are NP-complete. (English) Zbl 1212.05217 OR Trans. 13, No. 2, 41-47 (2009). MSC: 05C70 05C17 PDFBibTeX XMLCite \textit{J. Yu} et al., OR Trans. 13, No. 2, 41--47 (2009; Zbl 1212.05217)
Plotnikov, Anatoly D. Polynomial-time partition of a graph into cliques. (English) Zbl 0904.05069 Southwest J. Pure Appl. Math. 1, 16-29 (1996). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{A. D. Plotnikov}, Southwest J. Pure Appl. Math. 1, 16--29 (1996; Zbl 0904.05069) Full Text: EuDML EMIS