COLORING EDGES OF A COMPLETE GRAPH

被引:0
|
作者
VARGA, AG
机构
关键词
D O I
10.1002/mana.19720520117
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:231 / &
相关论文
共 50 条
  • [1] COLORING EDGES OF A GRAPH
    SCHWENK, AJ
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1977, 84 (03): : 224 - 224
  • [2] COLORING THE EDGES OF A DIRECTED GRAPH
    Szabo, Sandor
    Zavalnij, Bogdan
    [J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2014, 45 (02): : 239 - 260
  • [3] Distributed Coloring of the Graph Edges
    Omranpour, H.
    Ebadzadeh, M.
    Barzegar, S.
    Shojafar, M.
    [J]. PROCEEDINGS OF THE 2008 7TH IEEE INTERNATIONAL CONFERENCE ON CYBERNETIC INTELLIGENT SYSTEMS, 2008, : 240 - +
  • [4] Coloring the edges of a directed graph
    Sándor Szabó
    Bogdán Zavalnij
    [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
    HADJIIVANOV, NG
    NENOV, ND
    [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
    NENOV, ND
    [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1981, 34 (09): : 1209 - 1212
  • [7] A PROOF OF 4-COLORING EDGES OF A CUBIC GRAPH
    JOHNSON, EL
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (01): : 52 - &
  • [8] Coloring vertices and edges of a graph by nonempty subsets of a set
    Balister, P. N.
    Gyori, E.
    Schelp, R. H.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (04) : 533 - 537
  • [9] Coloring the edges of a random graph without a monochromatic giant component
    Spoehel, Reto
    Steger, Angelika
    Thomas, Henning
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [10] ON COLORING PARTIAL JOINS OF A COMPLETE GRAPH AND A CYCLE
    STIEBITZ, M
    WESSEL, W
    [J]. MATHEMATISCHE NACHRICHTEN, 1993, 163 : 109 - 116