ON POWERS OF M-TRAPEZOID GRAPHS

被引:27
作者
FLOTOW, C
机构
[1] Mathematisches Seminar der Universität Hamburg, 20146 Hamburg
关键词
D O I
10.1016/0166-218X(95)00062-V
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
First a new class of graphs is introduced: m-trapezoid graphs are the intersection graphs of m-trapezoids, where an m-trapezoid is given by m + 1 intervals on m fl parallel lines. The main result of this paper is that if G(k-1) is an m-trapezoid graph then G(k) is also an m-trapezoid graph. This theorem has some interesting corollaries concerning interval graphs, trapezoid graphs and cocomparability graphs: If A is either of these classes, then G(k-1) is an element of A implies G(k) is an element of A. This answers an open question of P. Damaschke.
引用
收藏
页码:187 / 192
页数:6
相关论文
共 10 条
  • [1] POWERS OF CHORDAL GRAPHS
    BALAKRISHNAN, R
    PAULRAJA, P
    [J]. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1983, 35 (OCT): : 211 - 217
  • [2] TRAPEZOID GRAPHS AND THEIR COLORING
    DAGAN, I
    GOLUMBIC, MC
    PINTER, RY
    [J]. DISCRETE APPLIED MATHEMATICS, 1988, 21 (01) : 35 - 46
  • [3] DAHLHAUS E, 1987, ARS COMBIN B, V24, P23
  • [4] DISTANCES IN COCOMPARABILITY GRAPHS AND THEIR POWERS
    DAMASCHKE, P
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 35 (01) : 67 - 72
  • [5] Duchet P., 1984, ANN DISCRETE MATH, V88, P67
  • [6] ON POWERS AND CENTERS OF CHORDAL GRAPHS
    LASKAR, R
    SHIER, D
    [J]. DISCRETE APPLIED MATHEMATICS, 1983, 6 (02) : 139 - 147
  • [7] LIN Y, UNPUB ALGORITHMS SQU
  • [8] Raychaudhuri A, 1987, C NUMER, V59, P235
  • [9] RAYCHAUDHURI A, UNPUB POWERS STRONGL
  • [10] TROTTER WT, 1991, COMBINATORICS PARTIA