fclasstwographswhosefcoreshavemaximumdegreetwo

CSpace > 应用数学研究所

	fclasstwographswhosefcoreshavemaximumdegreetwo
	Zhang Xia 1; Yan Guiying2 ; Cai Jiansheng 3
	2014
发表期刊	actamathematicasinicaenglishseries
ISSN	1439-8516
卷号	30 期号:4 页码:601
摘要	An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex nu a V (G) at most f(nu) times. The f-core of G is the subgraph of G induced by the vertices nu of degree . In this paper, we find some necessary conditions for a simple graph, whose f-core has maximum degree two, to be of class 2 for f-colorings.
语种	英语
资助项目	[National Natural Science Foundation of China] ; [Tianyuan Youth Foundation of Mathematics] ; [Natural Science Foundation of Shandong] ; [Shandong Province Higher Educational Science and Technology Program of China]
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/42168
专题	应用数学研究所
作者单位	1.山东师范大学 2.中国科学院数学与系统科学研究院 3.潍坊学院
推荐引用方式 GB/T 7714	Zhang Xia,Yan Guiying,Cai Jiansheng. fclasstwographswhosefcoreshavemaximumdegreetwo[J]. actamathematicasinicaenglishseries,2014,30(4):601.
APA	Zhang Xia,Yan Guiying,&Cai Jiansheng.(2014).fclasstwographswhosefcoreshavemaximumdegreetwo.actamathematicasinicaenglishseries,30(4),601.
MLA	Zhang Xia,et al."fclasstwographswhosefcoreshavemaximumdegreetwo".actamathematicasinicaenglishseries 30.4(2014):601.