The lower limit of the independence number in edge chromatic critical graphs
Linming QI1,*(), Weiliang ZHAO1, Lianying MIAO2
1. Zhejiang Industry Polytechnic College, Shaoxing 312000, Zhejiang, China 2. School of Mathematics and Science, Nanjing Normal University, Nanjing 210023, Jiangsu, China
Linming QI, Weiliang ZHAO, Lianying MIAO. The lower limit of the independence number in edge chromatic critical graphs[J]. Operations Research Transactions, 2025, 29(1): 225-231.
Miao L Y . On the indepence number of edge chromatic critical graphs[J]. Ars Combinatoria, 2011, 98, 471- 481.
4
Zhang L . Every planar graph with maximum degree 7 is of class 1[J]. Graphs and Combinatorics, 2000, 16, 467- 495.
doi: 10.1007/s003730070009
5
Luo R , Miao L Y , Zhao Y . The size of edge chromatic critical graphs with maximum degree 6[J]. Graphs Theory, 2009, 60, 149- 171.
doi: 10.1002/jgt.20351
6
Sanders D , Yue Z . Planar graphs with maximum degree seven are class 1[J]. Journal of Combinatorial Theory, 2001, 83 (2): 201- 212.
doi: 10.1006/jctb.2001.2047
7
Li S C , Li X C . Edge coloring of graphs with small maximum degree[J]. Discrete Mathematics, 2009, 309, 4843- 4852.
doi: 10.1016/j.disc.2008.07.006