云南高校图书馆联盟文献共享服务平台- CLAW-FREE

CLAW-FREE: 作品数：13被引量：9H指数：2; 导出分析报告; 相关领域：理学更多>>; 相关机构：福州大学北京理工大学更多>>; 相关期刊：《Journal of Mathematical Research with Applications》《Science China Mathematics》《Acta Mathematicae Applicatae Sinica》《Chinese Quarterly Journal of Mathematics》更多>>; 相关基金：国家自然科学基金更多>>

The Injective Chromatic Index of a Claw-Free Subcubic Graph is at Most 6: 《Journal of Mathematical Research with Applications》2023年第4期409-416,共8页Xiaoyuan DONG Yuquan LIN Wensong LIN; Supported by the National Natural Science Foundation of China(Grant No.11771080).; A coloring of edges of a graph G is injective if for any two distinct edges e1 and e2,the coloring of e1 and e2 are distinct if they are at distance 2 in G or in a common 3-cycle.The injective chromatic index of G is ...; 关键词：injective edge coloring injective chromatic index CLAW-FREE subcubic graph

Characterizations of Cycle-Forced 2-Connected Claw-Free Cubic Graphs: 《Chinese Quarterly Journal of Mathematics》2022年第4期432-440,共9页ZHANG Yi-ran WANG Xiu-mei; Supported by National Natural Science Foundation of China(Grant Nos.12171440 and 11971445)。; Let G be a graph and C be an arbitrary even cycle of G.The graph G is called a cycle-forced graph if G-V(C)has a unique perfect matching.When C is an arbitrary induced even cycle of G,G is called an induced-cycle-forc...; 关键词：Perfect matching Cubic graph Claw-free graph Cycle-forced graph

The Hamilton-Connectivity with the Degree Sum of Non-adjacent Subgraphs of Claw-free Graphs: 《Acta Mathematicae Applicatae Sinica》2019年第3期580-590,共11页Wei ZHENG Li-gong WANG; supported by the National Natural Science Foundation of China(No.11871398);the Natural Science Basic Research Plan in Shaanxi Province of China(Program No.2018JM1032);the Fundamental Research Funds for the Central Universities(No.3102019ghjd003);the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University(No.ZZ2019031); The degree d(H)of a subgraph H of a graph G is|u∈∪V(H)N(u)-V(H)|,where N(u)denotes the neighbor set of the vertex u of G.In this paper,we prove the following result on the condition of the degrees of subgraphs.Let G...; 关键词：CLAW-FREE graph non-adjacent SUBGRAPH degree of SUBGRAPH Hamilton path

Cover a 3-regular Claw-free Graph by Induced Matchings: 《Chinese Quarterly Journal of Mathematics》2011年第3期355-359,共5页DONG Li TANG Jing-yong SONG Xin-yu; Supported by the National Natural Science Foundation of China（10771179）; The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G...; 关键词：induced matching induced matching cover 3-regular claw-free

Bounds on the clique-transversal number of regular graphs被引量：5: 《Science China Mathematics》2008年第5期851-863,共13页CHENG T.C.E; the National Nature Science Foundation of China (Grant Nos.10571117,60773078);the Hong Kong Polytechnic University (Grant No.G-YX69) ;Shuguang Plan of Shanghai Education Development Foundation (Grant No.06SG42); A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted τ c (G), is the minimum cardinality of a clique-transversal set in G. In th...; 关键词：graph regular graph claw-free cubic graph clique-transversal set clique-transversal number 05C65 05C69 05C75

Longest Paths and Cycles in Connected Claw-Free Graphs: 《Transactions of Tianjin University》2004年第3期221-224,共4页李明楚李旭东; SupportedbytheprojectT2 3ofLiuHuiCenterforAppliedMathe maticsofNankaiUniversityandTianjinUniversity ;andNationalNaturalScienceFoundationofChina(No 90 4 12 0 0 7); A graph is called claw-free if it does not contain a claw as its induced subgraph.In this paper, we prove the following results:1)If G is a 2-connected claw-free graph on n vertices,then for any vertex v and any two d...; 关键词：longest path CYCLE claw-free graph

A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS被引量：2: 《Journal of Systems Science & Complexity》2001年第1期91-92,共2页XU Baoguang, LIU Zhenhong (Institute of Systems Science, Chinese Academy of Sciences, Beijing 100080, China); the National Natural Science Foundation of China.; In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.; 关键词：CONNECTED FACTOR CLAW-FREE GRAPH [f g]-factor.

Hamiltonicity Quasi-locally Connected G of Claw-Free Graphs: 《Systems Science and Systems Engineering》1997年第4期129-130,共2页; ＨａｍｉｌｔｏｎｉｃｉｔｙＱｕａｓｉ－ｌｏｃａｌｙＣｏｎｎｅｃｔｅｄＧｏｆＣｌａｗ－ＦｒｅＧｒａｐｈｓＳｕｐｐｏｒｔｅｄｂｙｔｈｅＨｉｇｈＥｄｕｃａｔｉｏｎａｌＩｎｓｔｉｔｕｔｅＳｃｉｅｎｔｉｆｉｃＲｅａｓｕｒｃｈＦ...; 关键词：CLAW-FREE CONNECTED GRAPHS HAMILTONICITY

Neighborhood Intersections and Hamiltonian property in Claw-Free Graphs: 《Journal of Southeast University(English Edition)》1997年第2期108-111,共4页王冬冬; We prove the following result: Let G be a 2 connected claw free graph of order n(n≥3) and connectivity k . If for any independent set S k+1 with cardinality k+1 , there exist u,v∈S k+1 ...; 关键词：CLAW free graph independent set longest cycle CONNECTIVITY

PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS被引量：2: 《Systems Science and Mathematical Sciences》1997年第3期267-274,共8页WANG Jianglu(Department of Mathematics, Shandong Teachers’ University, Ji’nan 250014, China)ZHU Yongjin(Institute of Systems Science, Academia Sinica, Beijing 100080, China); In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable.; 关键词：CLAW-FREE graph LOCALLY k-connected PATH extendable.

CLAW-FREE