θ-图的连续边着色(英文)Consecutive Colorings of the Edges of θ-graph
冯永锝,翟绍辉
摘要(Abstract)：
设G是简单图,用颜色1 ,2 ,3……对G的边着色.如果每一顶点所关联的边上着的颜色构成一个连续的整数集合,那么就称这个边着色是连续的.本文中证明了θ-图有这样的连续边着色.
关键词(KeyWords)： 连续着色;图的缺格;边着色
基金项目(Foundation):
作者(Author): 冯永锝,翟绍辉
参考文献(References)：
- [1]GiaroK,KubaleM,MalafiejskiM.Consecutive colorings of the edges of general graphs[J].DiscreteMath,2001,236:131-143.
- [2]SevastjanovS V.On interal colorability of a bipartite graph(inRussian)[J].MetDisKretAnaliz,1990,50:61-72.
- [3]AsratianA S,KamalianR R.Investigation on interal edge-colorings of graphs[J].JCombinTheorySer,B1994,62:34-43.
- [4]AsratianA S,DenleyT M J,HaggkviistR.BipartiteGraphs and theirApplications[M].CambridgeUniversityPress,Cambridge,1998.
- [5]GiaroK,KubaleM.Consecutive edge-colorings of complete and incompleteCartesian products of graphs[J].CongrNumer,1997,128:143-149.
- [6]GiaroK,KubaleM.Compact scheduling of zero-one time operations in multistage system[J].DiscreteApplMath2004,145:95-103.
- [7]GiaroK,KubaleM.Malafiejski.M compact scheduling in open shop with zero-one time operations[J].INFOR1999,37:37-47.
- [8]HansonD,LotenC O M.On interval colorings of bi-regular bipartite graphs[J].ArsCombin,1998,50:23-32.
- [9]KubaleM.TheComplexity ofScheduling independent two-processor tasks on dedicated processors[J].Inform.PracessLett,1987,24:141-147.