ON THE NUMBER OF MONOCHROMATIC PARA-CLIQUES IN 2-COLORING EDGES OF SOME COMPLETE GRAPHS

被引:0
|
作者
NENOV, ND
PASHOV, IZ
HADJIIVANOV, NG
机构
来源
关键词
D O I
暂无
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
引用
收藏
页码:439 / 442
页数:4
相关论文
共 50 条
  • [1] NUMBER OF PARA-CLIQUES IN GRAPHS WITH PARA-FILTERS
    HADJIIVANOV, NG
    NENOV, ND
    [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1977, 30 (09): : 1231 - 1234
  • [2] The minimum number of vertices of graphs containing two monochromatic triangles for any edge 2-coloring
    Matsumoto, Naoki
    Yamamoto, Masaki
    Yamazaki, Masahito
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 81 : 208 - 232
  • [3] On the weak 2-coloring number of planar graphs
    Almulhim, Ahlam
    Kierstead, H. A.
    [J]. DISCRETE MATHEMATICS, 2022, 345 (01)
  • [4] 2-Coloring number revisited
    Janczewski, Robert
    Obszarski, Pawel
    Turowski, Krzysztof
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 796 : 187 - 195
  • [5] Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
    Karpinski, Michal
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 659 : 88 - 94
  • [6] GRAPHS WITH MONOCHROMATIC COMPLETE SUBGRAPHS IN EVERY EDGE COLORING
    FOLKMAN, J
    [J]. SIAM REVIEW, 1968, 10 (02) : 264 - &
  • [7] On 1-improper 2-coloring of sparse graphs
    Borodin, O. V.
    Kostochka, A.
    Yancey, M.
    [J]. DISCRETE MATHEMATICS, 2013, 313 (22) : 2638 - 2649
  • [9] Approximating Maximum Edge 2-Coloring in Simple Graphs
    Chen, Zhi-Zhong
    Konno, Sayuri
    Matsushita, Yuki
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 78 - 89
  • [10] Approximating Maximum Edge 2-Coloring by Normalizing Graphs
    Moemke, Tobias
    Popa, Alexandru
    Roshany-Tabrizi, Aida
    Ruderer, Michael
    Vincze, Roland
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2023, 2023, 14297 : 29 - 44