COUNTING COLORED GRAPHS .3.

被引：4
|
作者：
WRIGHT, EM
机构：
来源：
CANADIAN JOURNAL OF MATHEMATICS | 1972年 / 24卷 / 01期
关键词：
D O I：
10.4153/CJM-1972-010-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：82 / &
相关论文
共 50 条
  • [1] Counting Colored Tilings on Grids and Graphs
    Ramirez, Jose L.
    Villamizar, Diego
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (403):
  • [2] COUNTING COLORED GRAPHS OF HIGH CONNECTIVITY
    BOLLOBAS, B
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1981, 33 (02): : 476 - 484
  • [3] Counting rainbow triangles in edge-colored graphs
    Li, Xueliang
    Ning, Bo
    Shi, Yongtang
    Zhang, Shenggui
    JOURNAL OF GRAPH THEORY, 2024, 107 (04) : 742 - 758
  • [4] Counting Perfect Matchings in Chain Graphs with the Specific Colored Faces
    Saduakdee, Supaporn
    Maliwan, Pattana
    Singthong, Thitaporn
    Sirilap, Supatta
    Khemmani, Varanoot
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (03): : 677 - 686
  • [5] Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
    Belcastro, Sarah-marie
    Haas, Ruth
    DISCRETE MATHEMATICS, 2014, 325 : 77 - 84
  • [6] TRIANGULATING 3-COLORED GRAPHS
    KANNAN, SK
    WARNOW, TJ
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (02) : 249 - 258
  • [7] INDUSTRIAL COUNTING .3.
    PARKINSON, BA
    INDUSTRIAL ELECTRONICS, 1968, 6 (09): : 360 - +
  • [8] MITOSIS COUNTING .3.
    NORRIS, HJ
    HUMAN PATHOLOGY, 1976, 7 (04) : 483 - 484
  • [9] A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
    Fang, Xiao
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2015, 20 : 1 - 6
  • [10] COUNTING OF 3-CONNECTED GRAPHS
    WAKSH, TR
    DOKLADY AKADEMII NAUK SSSR, 1979, 247 (02): : 297 - 300
12345