STRONG PRODUCTS OF KNESER GRAPHS

被引:7
|
作者
KLAVZAR, S [1 ]
MILUTINOVIC, U [1 ]
机构
[1] UNIV MARIBOR,PF,MARIBOR 62000,SLOVENIA
关键词
D O I
10.1016/0012-365X(94)90037-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G X H be the strong product of graphs G and H. We give a short proof that chi(G X H) greater-than-or-equal-to chi(G) + 2omega(H)-2. Kneser graphs are then used to demonstrate that this lower bound is sharp. We also prove that for every n greater-than-or-equal-to 2 there is an infinite sequence of pairs of graphs G and G' such that G' is not a retract of G while G' X K(n) is a retract of G X K(n).
引用
收藏
页码:297 / 300
页数:4
相关论文
共 50 条
  • [31] Random Kneser graphs and hypergraphs
    Kupavskii, Andrey
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
  • [32] Achromatic numbers of Kneser graphs
    Araujo-Pardo, Gabriela
    Carlos Diaz-Patino, Juan
    Rubio-Montiel, Christian
    ARS MATHEMATICA CONTEMPORANEA, 2021, 21 (01)
  • [33] Choice number of Kneser graphs
    Bulankina, Vera
    Kupavskii, Andrey
    DISCRETE MATHEMATICS, 2022, 345 (11)
  • [34] Kneser Graphs and their Complements are Hyperenergetic
    Akbari, S.
    Moazami, F.
    Zare, S.
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2009, 61 (02) : 361 - 368
  • [35] Bipartite Kneser Graphs are Hamiltonian
    Torsten Mütze
    Pascal Su
    Combinatorica, 2017, 37 : 1207 - 1219
  • [36] Local coloring of Kneser graphs
    Omoomi, Behnaz
    Pourmiri, Ali
    DISCRETE MATHEMATICS, 2008, 308 (24) : 5922 - 5927
  • [37] On the treewidth of generalized Kneser graphs
    Metsch, Klaus
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2023, 86 : 477 - 486
  • [38] Sparse Kneser graphs are Hamiltonian
    Mutze, Torsten
    Nummenpalo, Jerri
    Walczak, Bartosz
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2021, 103 (04): : 1253 - 1275
  • [39] Hamiltonian threshold for strong products of graphs
    Kral, Daniel
    Stacho, Ladislav
    JOURNAL OF GRAPH THEORY, 2008, 58 (04) : 314 - 328
  • [40] Hamilton cycles in strong products of graphs
    Král, D
    Maxová, J
    Sámal, R
    Podbrdsky, P
    JOURNAL OF GRAPH THEORY, 2005, 48 (04) : 299 - 321