P<sub>4</sub>-free图的控制团及应用(英文)

薛妮妮

您当前的位置：

首页 >

文章列表页 >

P₄-free图的控制团及应用(英文)

更新时间：2026-01-21

- P₄-free图的控制团及应用(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 112, Issue 4, Pages: 425-427(2008)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2008
- 稿件说明：
移动端阅览
[1]薛妮妮.P_4-free图的控制团及应用(英文)[J].新疆大学学报(自然科学版),2008,No.112(04):425-427.

薛妮妮. P₄-free图的控制团及应用(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 112(4): 425-427.
[1]薛妮妮.P_4-free图的控制团及应用(英文)[J].新疆大学学报(自然科学版),2008,No.112(04):425-427. DOI：

薛妮妮. P₄-free图的控制团及应用(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 112(4): 425-427. DOI：

摘要

得到了P4-free图的控制团的阶数为1或2

并利用此性质证明了P4-free图的线图是哈密顿的.

Abstract

In this paper we show that any P4-free graph G has a dominating clique of cardinality 1 or 2

and

as an application

that the line graph L(G) of G is hamiltonian.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph Theory with Applicatio[M].New York: Macmillan London and American Elsevier,1976.

Hemmeinger R L,Beineke L W.Selected topic in graph theory[M].New York: Academic press,1978.271-306.

Thomassen C.Reflections on graph theory[J].J Graph Theory,1986,10: 309-324.

Ryˇjácek Z.On a closure concept in claw-free graphs[J].J Combin Theory Ser B,1997,70:217-224.

Matthews M M,Sumner D P.Hamiltonian results in K1,3-free graphs[J].J Graph Theory,1984,8:139-146.

Zhan S.Hamiltonian connectedness of line graphs[J].ArsCombin,1986,22: 89-95.

Lai H J.Every 4-connected line graph of a planar graph is hamiltonian[J].Graphs Combin,1994,10: 249-253.

Kriesell M.All 4-connected line graphs of claw-free graphs are hamiltonian connected[J].J Combin Theory Ser B, 2001,82: 306-315.

Ainouche A,Broersma HJ,Veldman HJ.Remarks on hamiltonian properties of claw-free graphs[J].Ars Combin, 1990,29: 110-121.

Harary F,J A C.St.Nash-Williams,On eulerian and hamiltonian and line graphs[J].Cand Math Bull,1965,8: 701-709.

Wolk E S.The comparability graph of a tree[J].Proc Amer Math Soc,1962,3: 789-795.

Ba’csoG,Tuza Z.Dominating cliques in P5-free graphs[J].Periodica Math Hungar,1990,21: 303-308.

Ba′csoG,Tuza Z.Dominating properties and induced subgraphs[J].Discrete Mathematics,1983,111: 37-40.

Cozzens M B,Kelleher L L.Dominating cliques in graphs[J].Discrete Mathematics,1990,86: 101-116.

Liu J,Zhou H.Dominating subgraphs in graphs with some forbidden structures[J].Discrete Mathematics,1994, 135: 163-168.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

立方体的线图的限制性连通度(英文)

线图的邻域连通度(英文)

路图P₃(G)的色数(英文)

关于中间图补图的一个定理的简单证明(英文)

Related Author

林辉球

孟吉翔

田应智

赵雪冰

张昭

孔祥艳

安新慧

黄琼湘

Related Institution

新疆大学数学与系统科学学院,新疆大学数学与系统科学学院,新疆工业高等专科学校新疆乌鲁木齐830046,新疆乌鲁木齐830046

⁰

P4-free图的控制团及应用(英文)

DOI：

摘要

Abstract

关键词

Keywords

references

P₄-free图的控制团及应用(英文)