薛耀昉教授和图论专家陈子岐教授都是北京大学数学系1953级学生并他俩的同班同学高庆狮、黄琳、姜伯驹、沈绪榜、石青云等都已成为中科院院士，以第一作者撰写《并行图论算法》的唐策善教授也是同学，但这学科之难如在期刊网可见他们的论文是11篇和8篇,而下面是他们最后的4篇论文并他俩都合作这些论文,并在美国数学评论知他俩都没有在国外发表过论文,现在或难理解以前开拓的不容易的:.
陈子岐,薛耀昉, 控制迹存在的某些充分条件, 《内蒙古大学学报(自然科学版)》 1990年04期;
连通d(u)+d(v)+d(w)+d(z)³n-1, 若不属于y则有控制迹; 连通d(e)+d(f)+d(s)³n-6, 若不属于x则有控制迹.
陈子岐,薛耀昉, 生成迹存在的一个充分条件, 《内蒙古大学学报(自然科学版)》 1990年04期;
连通d(u)+d(v)+d(w)³n-3, 若不属于z则有生成迹;
薛耀昉,陈子岐, k-连通无爪图中的生成圈和控制圈, 《内蒙古大学学报(自然科学版)》 1991年04期;
k-连通无爪图的å|M|=kd(u)³3n-6k-3, 推论d(u)+d(v)³3n/k-8, 若不属于Y则有生成圈; å|M|=k+1d(u)³3n-4k-4, 推论d(u)+d(v)³3n/(k+1)-5, 若不属于W则有控制圈.
薛耀昉,陈子岐, 控制迹与线图的泛圈性, 《内蒙古大学学报(自然科学版)》 1992年02期
d(u)+d(v)³n-1,其后不属于P则任2点有生成迹, 以及线图L(G)不属于Q则为几乎nested点泛圈图.
参考一些国外专家的相关工作：
F. Harary, C.St.J.A. Nash-Williams,
On Eulerian and Hamiltonian
graphs and line graphs, Canad. Math. Bull., 8 (1965), pp. 701-710
Richard A
Brualdi, Robert F. Shanny, Hamiltonian line
graphs. J. Graph Theory 5 (1981),
no. 3, 307--314.
Paul A. Catlin, Spanning
trails. J. Graph Theory 11 (1987), no.
2, 161--167.
Hong-Jian Lai, Eulerian subgraphs
containing given vertices and hamiltonian line graphs, Discrete Math., 178
(1998) 93-107
Paul
A.Catlin, Zheng-Yiao Han, Hong-Jian Lai, Graphs
without spanning closed trails, Discrete Mathematics Vol. 160, no. 1–3,
1996, P. 81-91
Cun-Quan
Zhang, Hamilton cycles in
claw-free graphs. J. Graph Theory 12 (1988), no.
2, 209--216.
Linda
M. Lesniak-Foster, James E. Williamson, On spanning and dominating circuits in graphs. Canad. Math. Bull. 20 (1977), no.
2, 215--220.
Abdelhamid Benhocine, L. Clark, N. Köhler, H. J. Veldman, On
circuits and pancyclic line graphs. J. Graph Theory 10 (1986), no. 3,
411--425.
H. J. Veldman, Existence
of spanning and dominating trails and circuits, J. Graph Theory 10 (1986), no. 1, 23--31.
H. J. Veldman, Existence
of dominating cycles and paths, Discrete Mathematics Vol. 43, 1983, no.2–3,P.
281-296
Lane Clark,. On Hamiltonian line
graphs. J. Graph Theory 8 (1984), no.
2, 303--307.
Mohamed H. El-Zahar, On circuits in graphs. Discrete Math. 50 (1984), no. 2-3,
227--230.（Mohamed H. El-Zahar在1985年提出指数图）
最近,一些相关的问题或有意思的发展工作:
Kiyoshi Yoshimoto, Edge
degrees and dominating cycles, Discrete Math. 308 (2008), no. 12, 2594--2599.
连通d(e)+d(f)³n-5, 若不属于x则所有最长圈是控制圈.
Kiyoshi Yoshimoto,
Degree sum and connectivity
conditions for dominating cycles, Discrete Math. 308 (2008), no. 9, 1620--1627.
Hong-Jian Lai, Yehong
Shao, On s-Hamiltonian line
graphs. J. Graph Theory 74 (2013), no. 3, 344–358
Zhi-Hong Chen, Hong-Jian Lai, Meng
Zhang, Spanning
trails with variations of Chvátal–Erdős conditions, Discrete Mathematics,
Vol. 340, 2, ,2017, P.243-251;
Shuya Chiba, Michitaka Furuya, Shoichi
Tsuchiya, Forbidden
pairs and the existence of a dominating cycle, Discrete Math. 338 (2015), no. 12, 2442--2452.
还可参考：
吴正声,在大的邻域并图中长的控制路,
孙志人,田丰,卫兵, 图的度和、连通度和控制圈, 《科学通报》
1998年04期
等等
…
