Author:
Cole Richard,Kowalik Łukasz
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. Chrobak, M., Yung, M.: Fast algorithms for edge-coloring planar graphs. J. Algorithms 10, 35–51 (1989)
2. Chrobak, M., Nishizeki, T.: Improved edge-coloring algorithms for planar graphs. J. Algorithms 11, 102–116 (1990)
3. Vizing, V.G.: On the estimate of the chromatic class of a p-graph. Diskret. Anal. 3, 25–30 (1964)
4. Gabow, H.N., Nishizeki, T., Kariv, O., Leven, D., Terada, O.: Algorithms for edge coloring graphs. Technical Report TR-41/85, Department of Computer Science, Tel Aviv University (1985)
5. Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(Elog D) time. Combinatorica 21, 5–12 (2001)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Edge Coloring on Dynamic Graphs;Database Systems for Advanced Applications;2023
2. Total tessellation cover: Bounds, hardness, and applications;Discrete Applied Mathematics;2021-10
3. Complexity and algorithms for injective edge-coloring in graphs;Information Processing Letters;2021-09
4. On distributed forest decomposition of graphs with bounded arboricity;2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC);2021-01-27
5. Lexico-Minimum Replica Placement in Multitrees;Combinatorial Optimization and Applications;2017