典型文献
2-divisibility of Some Odd Hole Free Graphs
文献摘要：
Let G be a graph.We say that G is 2-divisible if for each induced subgraph H of G,either V(H)is a stable set,or V(H)can be partitioned into two sets A and B such that ω(H[A])＜ω(H)and ω(H[B])＜ω(H).A hole is an induced cycle of length at least 4,a bull is a graph consisting of a triangle with two disjoint pendant edges,a diamond is the graph obtained from K4 by removing an edge,a dart denotes the graph obtained from a diamond by adding a pendant edge to one vertex of degree 3,and a racket denotes the graph obtained from a diamond by adding a pendant edge to one vertex of degree 2.In this paper,we prove that every{odd hole,H}-free graph is 2-divisible,where H is a dart,or a racket,or a bull.As corollaries,x(G)≤min{2ω(G)-1,(ω(G2)+1)}if G is{odd hole,dart}-free,or{odd hole,racket}-free,or{odd hole,bull}-free.
文献关键词：
中图分类号：
作者姓名：
Wei DONG;Jia-lei SONG;Bao-gang XU
作者机构：
School of Information and Engineering,Nanjing Xiaozhuang University,Nanjing 211171,China;Institute of Mathematics,School of Mathematical Sciences,Nanjing Normal University,Nanjing 210023,China
文献出处：
引用格式：
[1]Wei DONG;Jia-lei SONG;Bao-gang XU-.2-divisibility of Some Odd Hole Free Graphs)[J].应用数学学报（英文版）,2022(03):710-718
A类：
divisibility,divisible,dart,racket,corollaries
B类：
Some,Odd,Hole,Free,Graphs,Let,be,We,say,that,if,each,induced,subgraph,either,stable,can,partitioned,into,two,sets,such,hole,cycle,length,least,bull,consisting,triangle,disjoint,pendant,edges,diamond,obtained,from,K4,by,removing,denotes,adding,vertex,degree,In,this,paper,we,prove,every,odd,free,where,G2,+1
AB值：
0.401362
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
