Author:
Wu Baoyindureng,An Xinhui
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Borodin, O.V.: A Generalization of Kotzig’s Theorem and Prescribed Edge Coloring of Planar Graphs. Mat. Zametki 48, 22–28 (1990)
2. Chen, Y., Zhu, W., Wang, W.: Edge Choosability of Planar Graphs without 5-Cycles with a Chord. Discrete Math. (to appear)
3. Choudum, S.A.: Some 4-Valent, 3-Connected, Planar, Almost Pancyclic Graphs. Discrete Math. 18, 125–129 (1977)
4. Fijavz, G., Juvan, M., Mohar, B., Skrekovski, R.: Planar Graphs without Cycles of Specific Lengths. Europ. J. Combin. 23, 377–388 (2002)
5. Häggkvist, R., Janssen, J.: New Bounds on the List-Chromatic Index of the Complete Graph and other Simple Graphs. Combin. Probab. Comput. 6(3), 295–313 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献