GENERATION OF K-TREES

被引：0

作者：

FIDLER, JK

HORROCKS, DH

机构：

[1] UNIV ESSEX,DEPT ELECT ENGN SCI,COLCHESTER,ESSEX,ENGLAND

[2] UNIV COLL WALES,DEPT ELECT & ELECTR ENGN,CARDIFF,GLAMORGANSHIRE,WALES

来源：

关键词：

D O I：

10.1080/00207217308938429

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：185 / 187

页数：3

共 50 条

[31] EFFICIENT SETS IN PARTIAL K-TREES
TELLE, JA
PROSKUROWSKI, A
DISCRETE APPLIED MATHEMATICS, 1993, 44 (1-3) : 109 - 117
[32] Independence Number and k-Trees of Graphs
Yan, Zheng
GRAPHS AND COMBINATORICS, 2017, 33 (05) : 1089 - 1093
[33] On maximum Estrada indices of k-trees
Huang, Fei
Wang, Shujing
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 487 : 316 - 327
[34] On the signless Laplacian spectra of k-trees
Zhang, Minjie
Li, Shuchao
LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 467 : 136 - 148
[35] Finding independent spanning trees in partial k-trees
Zhou, X
Nishizeki, T
ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 168 - 179
[36] Bounding Mean Orders of Sub-k-Trees of k-Trees
Cambie, Stijn
McCoy, Bradley
Wagner, Stephan
Yap, Corrine
ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (01):
[37] Optimal broadcasting in almost trees and partial k-trees
Dessmark, A
Lingas, A
Olsson, H
Yamamoto, H
STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 432 - 443
[38] Independence Number and k-Trees of Graphs
Zheng Yan
Graphs and Combinatorics, 2017, 33 : 1089 - 1093
[39] Spanning k-trees of Bipartite Graphs
Kano, Mikio
Ozeki, Kenta
Suzuki, Kazuhiro
Tsugaki, Masao
Yamashit, Tomoki
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
[40] COMPLETELY INDEPENDENT SPANNING TREES IN (PARTIAL) k-TREES
Matsushita, Masayoshi
Otachi, Yota
Araki, Toru
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2015, 35 (03) : 427 - 437