Triangle contact systems, orthogonal plane partitions and their hit graphs

被引:0
|
作者
Nakamoto, A [1 ]
机构
[1] Osaka Kyoiku Univ, Dept Math, Osaka 5828582, Japan
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A triangle contact system S is a geometrical object on the plane consisting of finite number of triangular disks {s(1),...,s(n)} in a triangle Delta bounded by three segments A, B and C such that every vertex of each s(i) coincides with an inner point of either A, B, C or a segment of some s(j). An orthogonal plane partition P is a geometrical object on the plane consisting of a finite number of horizontal segments a(1),..., a(p) and vertical segments b(1),...,b(q) in a rectangle R bounded by four segments A, B, C and D with A horizontal such that every endpoint of each a(i) coincides with an inner point of either B, D or some b(j) and that every endpoint of each b(i) coincides with an inner point of either A, C or some a(j). From S and P we can construct a plane triangulation and a plane quadrangulation according to the adjacency of elements in S and P, respectively. In this paper, we give a survey for triangle contact systems, orthogonal plane partitions and their graphs constructed from them.
引用
收藏
页码:264 / 273
页数:10
相关论文
共 42 条
  • [1] On triangle cover contact graphs
    Sultana, Shaheena
    Hossain, Md. Iqbal
    Rahman, Md. Saidur
    Moon, Nazmun Nessa
    Hashem, Tahsina
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 69 : 31 - 38
  • [2] Realizability of graphs as triangle cover contact graphs
    Sultana, Shaheena
    Rahman, Md. Saidur
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 720 : 24 - 35
  • [3] 10 problems for partitions of triangle-free graphs
    Balogh, Jozsef
    Clemen, Felix Christian
    Lidicky, Bernard
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2024, 121
  • [4] Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions
    Nakamoto A.
    Watanabe M.
    [J]. Journal of Geometry, 2000, 68 (1-2) : 200 - 208
  • [5] Partitions of complete geometric graphs into plane trees
    Bose, P
    Hurtado, F
    Rivera-Campo, E
    Wood, DR
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 34 (02): : 116 - 125
  • [6] Partitions of complete geometric graphs into plane trees
    Bose, P
    Hurtado, F
    Rivera-Campo, E
    Wood, DR
    [J]. GRAPH DRAWING, 2004, 3383 : 71 - 81
  • [7] Edge partitions of optimal 2-plane and 3-plane graphs
    Bekos, Michael A.
    Di Giacomo, Emilio
    Didimo, Walter
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    [J]. DISCRETE MATHEMATICS, 2019, 342 (04) : 1038 - 1047
  • [8] Orthogonal drawings of plane graphs without bends
    Rahman, S
    Naznin, M
    Nishizeki, T
    [J]. GRAPH DRAWING, 2002, 2265 : 392 - 406
  • [9] New results on edge partitions of 1-plane graphs
    Di Giacomo, Emilio
    Didimo, Walter
    Evans, William S.
    Liotta, Giuseppe
    Meijer, Henk
    Montecchiani, Fabrizio
    Wismath, Stephen K.
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 713 : 78 - 84
  • [10] ORTHOGONAL SYSTEMS IN FINITE GRAPHS
    Duncan, A. J.
    Kazachkov, I., V
    Remeslennikov, V. N.
    [J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2008, 5 : 151 - 176