ZHANG J H,MENG J X.Restricted arc-connectivity of generalized De Bruijn digraphs and Kautz digraphs[J].Journal of Xinjiang University(Natural Science Edition in Chinese and English),2020,37(4):415-427.

ZHANG M Z,MENG J X,TIAN Y Z.On reliability of hypercubes in terms of extra edge-connectivity[J].Journal of Xinjiang University(Natural Science Edition),2013,30(3):253-256.

BAUDON O,BENSMAIL J,KALINOWSKI R,et al.On the Cartesian product of an arbitrarily partitionable graph and a traceable graph[J].Discrete Mathematics and Theoretical Computer Science,2014,16(2):225-232.

LIU F X,WU B,MENG J X.Partitioning the Cartesian product of a tree and a cycle[J].Applied Mathematies and Computation,2018,332:90-95.

LIU F X,WU B,MENG J X.Arbitrarily partitionble{2K2,C4}-free graphs[J].Discussiones Mathematicae Graph Theory,2019.https://doi.org/10.7151/dmgt.2289.

HOR NAK M,MARCZYK A,SCHIERMEYER I,et al.Dense arbitrarily vertex decomposable graphs[J].Graphs and Combinatorics,2012,28(6):807-821.

HOR NAK M,WOZNIAK M.Arbitrarily vertex decomposable trees are of maximum degree at most six[J].Opuscula Math,2003,23(23):49-62.

BARTH D,FOURNIER H.A degree bound on decomposable trees[J].Discrete Mathematics,2006,306(5):469-477.

CICHACZ S,AGNIESZKA GORLICH,MARCZYK A,et al.Arbitrarily vertex decomposable caterpillars with four or five leaves[J].Discussiones Mathematicae Graph Theory,2006,26(2):291-305.