FORBIDDEN MINORS CHARACTERIZATION OF PARTIAL 3-TREES

被引：65
|
作者：
ARNBORG, S [1 ]
PROSKUROWSKI, A [1 ]
CORNEIL, DG [1 ]
机构：
[1] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A4,ONTARIO,CANADA
来源：
DISCRETE MATHEMATICS | 1990年 / 80卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
10.1016/0012-365X(90)90292-P
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A k-tree is formed from a k-complete graph by recursively adding a vertex adjacent to all vertices in an existing k-complete subgraph. The many applications of partial k-trees (subgraphs of k-trees) have motivated their study from both the algorithmic and theoretical points of view. In this paper we characterize the class of partial 3-trees by its set of four minimal forbidden minors (H is a minor of G if H can be obtained from G by a finite sequence of edge-extraction and edge-contradiction operations.). © 1990.
引用
收藏
页码：1 / 19
页数：19
相关论文
共 50 条
  • [1] A CHARACTERIZATION OF PARTIAL 3-TREES
    SATYANARAYANA, A
    TUNG, L
    NETWORKS, 1990, 20 (03) : 299 - 322
  • [2] CHARACTERIZATION AND RECOGNITION OF PARTIAL 3-TREES
    ARNBORG, S
    PROSKUROWSKI, A
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (02): : 305 - 314
  • [3] CHARACTERIZATION OF PARTIAL 3-TREES IN TERMS OF 3 STRUCTURES
    KAJITANI, Y
    ISHIZUKA, A
    UENO, S
    GRAPHS AND COMBINATORICS, 1986, 2 (03) : 233 - 246
  • [4] Definability equals recognizability of partial 3-trees
    Kaller, D
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 239 - 253
  • [5] CANONICAL REPRESENTATIONS OF PARTIAL 2-TREES AND 3-TREES
    ARNBORG, S
    PROSKUROWSKI, A
    BIT, 1992, 32 (02): : 197 - 214
  • [6] CANONICAL REPRESENTATIONS OF PARTIAL 2-TREES AND 3-TREES
    ARNBORG, S
    PROSKUROWSKI, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 310 - 319
  • [7] Homomorphisms of partial t-trees and edge-colorings of partial 3-trees
    Chen, Meirun
    Naserasr, Reza
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 145 : 1 - 31
  • [8] A NOTE ON PARTIAL 3-TREES AND HOMOMORPHISM BASES OF GRAPHS
    HALIN, R
    ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1993, 63 : 29 - 36
  • [9] NC ALGORITHMS FOR RECOGNIZING PARTIAL 2-TREES AND 3-TREES
    GRANOT, D
    SKORINKAPOV, D
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (03) : 342 - 354
  • [10] Definability equals recognizability of partial 3-trees and k-connected partial k-trees
    Kaller, D
    ALGORITHMICA, 2000, 27 (3-4) : 348 - 381
12345