Retracts of infinite Hamming graphs

被引：5
|
作者：
Chastand, M
机构：
[1] I.A.E., Univ. Jean Moulin Lyon III, 69239 Lyon Cedex 2, 15, quai Claude Bernard
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1997年 / 71卷 / 01期
关键词：
D O I：
10.1006/jctb.1997.1746
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of Bandelt (1984, J. Graph Theory 8, 501-510) about median graphs, and improves a result of Wilkeit (1992, Discrete Math. 102, 191-218) and of Chung, Graham, and Saks (1989, Combinatorica 9, 111-131) about finite quasi-median graphs. (C) 1997 Academic Press.
引用
收藏
页码：54 / 66
页数：13
相关论文
共 50 条
  • [21] On an isoperimetric problem for Hamming graphs
    Harper, LH
    [J]. DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 285 - 309
  • [22] ELUSIVE CODES IN HAMMING GRAPHS
    Hawtin, Daniel R.
    Gillespie, Neil I.
    Praeger, Cheryl E.
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2013, 88 (02) : 286 - 296
  • [23] Characterizing subgraphs of Hamming graphs
    Klavzar, S
    Peterin, I
    [J]. JOURNAL OF GRAPH THEORY, 2005, 49 (04) : 302 - 312
  • [24] ISOMETRIC EMBEDDINGS IN HAMMING GRAPHS
    WILKEIT, E
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 50 (02) : 179 - 197
  • [25] Lattices associated with Hamming graphs
    Qi, Jinyun
    Zhang, Baohuan
    Li, Zengti
    [J]. ARS COMBINATORIA, 2016, 128 : 47 - 53
  • [26] Absolute retracts and varieties generated by chordal graphs
    Loten, Cynthia
    [J]. DISCRETE MATHEMATICS, 2010, 310 (10-11) : 1507 - 1519
  • [27] Hedetniemi's Conjecture and the Retracts of a Product of Graphs
    Benoit Larose
    Claude Tardif
    [J]. Combinatorica, 2000, 20 : 531 - 544
  • [28] On the complexity of recognizing hamming graphs and related classes of graphs
    Imrich, W
    Klavzar, S
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (2-3) : 209 - 221
  • [29] Antibandwidth and cyclic antibandwidth of Hamming graphs
    Dobrev, Stefan
    Kralovic, Rastislav
    Pardubska, Dana
    Toeroek, L'ubomir
    Vrt'o, Imrich
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (10-11) : 1402 - 1408
  • [30] Neighbour transitivity on codes in Hamming graphs
    Neil I. Gillespie
    Cheryl E. Praeger
    [J]. Designs, Codes and Cryptography, 2013, 67 : 385 - 393
12345