共 50 条
- [2] COLORING THE EDGES OF A DIRECTED GRAPH [J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2014, 45 (02): : 239 - 260
- [3] Distributed Coloring of the Graph Edges [J]. PROCEEDINGS OF THE 2008 7TH IEEE INTERNATIONAL CONFERENCE ON CYBERNETIC INTELLIGENT SYSTEMS, 2008, : 240 - +
- [4] Coloring the edges of a directed graph [J]. Indian Journal of Pure and Applied Mathematics, 2014, 45 : 239 - 260
- [5] GENERALIZATION OF A THEOREM OF GREENWOOD AND GLEASON ABOUT COLORING OF EDGES OF COMPLETE GRAPH WITH 9 POINTS [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1978, 31 (06): : 631 - 633
- [6] GENERALIZATION OF A THEOREM OF GREENWOOD AND GLEASON ABOUT 3-COLORING OF THE EDGES OF THE COMPLETE GRAPH WITH 17 VERTICES [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1981, 34 (09): : 1209 - 1212
- [7] A PROOF OF 4-COLORING EDGES OF A CUBIC GRAPH [J]. AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (01): : 52 - &
- [9] Coloring the edges of a random graph without a monochromatic giant component [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
- [10] ON COLORING PARTIAL JOINS OF A COMPLETE GRAPH AND A CYCLE [J]. MATHEMATISCHE NACHRICHTEN, 1993, 163 : 109 - 116