COLORING EDGES OF A COMPLETE GRAPH

被引：0
|
作者：
VARGA, AG
机构：
来源：
MATHEMATISCHE NACHRICHTEN | 1972年 / 52卷 / 1-6期
关键词：
D O I：
10.1002/mana.19720520117
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：231 / &
相关论文
共 50 条
  • [31] The coloring ideal and coloring complex of a graph
    Steingrímsson, E
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2001, 14 (01) : 73 - 84
  • [32] The Coloring Ideal and Coloring Complex of a Graph
    Einar Steingrímsson
    [J]. Journal of Algebraic Combinatorics, 2001, 14 : 73 - 84
  • [33] On the vertex-distinguishing proper edge coloring of composition of complete graph and star
    Yang, Fang
    Chen, Xiang-en
    Ma, Chunyan
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 217 - 221
  • [34] ON THE NUMBER OF MONOCHROMATIC PARA-CLIQUES IN 2-COLORING EDGES OF SOME COMPLETE GRAPHS
    NENOV, ND
    PASHOV, IZ
    HADJIIVANOV, NG
    [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1982, 35 (04): : 439 - 442
  • [35] The Algorithm Research on the Strong Vertex-Distinguishing Total Coloring of Complete Graph
    Zhao Huanping
    Tong Xuanyue
    [J]. 2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE), 2012, : 652 - 654
  • [36] Coloring Delaunay-edges and their generalizations
    Ackerman, Eyal
    Keszegh, Balazs
    Palvolgyi, Domotor
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2021, 96
  • [37] Relaxed coloring of a graph
    Deuber, W
    Zhu, XD
    [J]. GRAPHS AND COMBINATORICS, 1998, 14 (02) : 121 - 130
  • [38] Graph coloring algorithms
    Zhou, Xiao
    Nishizeki, Takao
    [J]. IEICE Transactions on Information and Systems, 2000, E83-D (03) : 407 - 417
  • [39] Nonrepetitive graph coloring
    Grytczuk, Jaroslaw
    [J]. Graph Theory in Paris: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 209 - 218
  • [40] Graph coloring with webMathematica
    Ufuktepe, Ü
    Bacak, G
    Beseri, T
    [J]. COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS, 2004, 3039 : 376 - 381
12345