EXTENDING PLANAR GRAPH ALGORITHMS TO K3,3-FREE GRAPHS

被引：0

|

作者：

KHULLER, S

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 338卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：67 / 79

页数：13

相关论文

共 50 条

[11] Bounds of Eigenvalues of K3,3-Minor Free Graphs
Fang, Kun-Fu
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2009,
[12] Exponential speedup of fixed-parameter algorithms on K3,3-minor-free or K5-minor-free graphs
Demaine, ED
Hajiaghayi, MT
Thilikos, DA
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 262 - 273
[13] Clique-Coloring of K3,3-Minor Free Graphs
Omoomi, Behnaz
Taleb, Maryam
BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2020, 46 (06) : 1539 - 1550
[14] CYCLES IN K1,3-FREE GRAPHS
施容华
Science Bulletin, 1987, (18) : 1293 - 1293
[15] STRONG PERFECT-GRAPH CONJECTURE IS TRUE FOR K1,3-FREE GRAPHS
PARTHASARATHY, KR
RAVINDRA, G
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 21 (03) : 212 - 223
[16] CYCLES IN K1,3-FREE GRAPHS
SHI, RH
KEXUE TONGBAO, 1987, 32 (18): : 1293 - 1293
[17] The structure of graphs with no K3,3 immersion
DeVos, Matt
Malekian, Mahdieh
JOURNAL OF GRAPH THEORY, 2021, 98 (01) : 5 - 23
[18] LOCALLY K3,3 OR PETERSEN GRAPHS
BLOKHUIS, A
BROUWER, AE
DISCRETE MATHEMATICS, 1992, 106 : 53 - 60
[19] ON CONNECTED FACTORS IN K1,3-FREE GRAPHS
李国君
刘振宏
Acta Mathematicae Applicatae Sinica, 1998, (01) : 43 - 47
[20] On K1,3-free strictly Deza graphs
A. V. Mityanina
Proceedings of the Steklov Institute of Mathematics, 2017, 297 : 159 - 162

← 1 2 3 4 5 →