A TIGHT LOWER BOUND ON THE SIZE OF VISIBILITY GRAPHS

被引：13

|

作者：

SHEN, X

EDELSBRUNNER, H

机构：

来源：

INFORMATION PROCESSING LETTERS | 1987年 / 26卷 / 02期

关键词：

D O I：

10.1016/0020-0190(87)90038-X

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：61 / 64

页数：4

相关论文

共 50 条

[1] Lower bound for the size of maximal nontraceable graphs
Frick, M
Singleton, J
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2005, 12 (01):
[2] A tight lower bound for Vertex Planarization on graphs of bounded treewidth
Pilipczuk, Marcin
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 231 : 211 - 216
[3] A TIGHT LOWER BOUND ON THE SIZE OF PLANAR PERMUTATION NETWORKS
KLAWE, M
LEIGHTON, T
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (04) : 558 - 563
[4] A TIGHT LOWER BOUND ON THE SIZE OF PLANAR PERMUTATION NETWORKS
KLAWE, M
LEIGHTON, T
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 281 - 287
[5] A tight lower bound on the matching number of graphs via Laplacian eigenvalues
Gu, Xiaofeng
Liu, Muhuo
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2022, 101
[6] Lower bound on the size-Ramsey number of tight paths
Winter, Christian
[J]. JOURNAL OF COMBINATORICS, 2023, 14 (02) : 271 - 279
[7] A TIGHT LOWER-BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS
FEIGE, U
[J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (04) : 433 - 438
[8] General lower bound on the size of (H; k)-stable graphs
Zak, Andrzej
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (02) : 367 - 372
[9] A lower bound on the size of (H; 1)-vertex stable graphs
Cichacz, Sylwia
Goerlich, Agnieszka
Nikodem, Mateusz
Zak, Andrzej
[J]. DISCRETE MATHEMATICS, 2012, 312 (20) : 3026 - 3029
[10] On the minimum size of visibility graphs
Olaverri, AG
Hurtado, F
Noy, M
Tejel, J
[J]. INFORMATION PROCESSING LETTERS, 2002, 81 (04) : 223 - 230

← 1 2 3 4 5 →