SCOPUS 정보 검색 플랫폼

Volumn 120, Issue 1-3, 2002, Pages 61-71

The structure of obstructions to treewidth and pathwidth

Author keywords

Obstruction set; Pathwidth; Treewidth

Indexed keywords

EID: 84867962063 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(01)00281-5 Document Type: Article

Times cited : (10)

References (13)

1
- 0346650162
- Forbidden minors characterization of partial 3-trees
- A. Arnborg, A. Proskurowski, and D. Corneil Forbidden minors characterization of partial 3-trees Discrete Math. 80 1990 1 19
- (1990) Discrete Math. , vol.80 , pp. 1-19
- Arnborg, A.¹ Proskurowski, A.² Corneil, D.³

2
- 0041620190
- On the tree width of a graph
- J. Chlebková On the tree width of a graph Acta Math. Univ. Comenian. LXI 2 1992 225 236
- (1992) Acta Math. Univ. Comenian. , vol.51 , Issue.2 , pp. 225-236
- Chlebková, J.¹

3
- 0001288032
- A characterization of comparability and interval graphs
- P.C. Gilmore, and A.J. Hoffman A characterization of comparability and interval graphs Canad. J. Math. 16 1964 539 548
- (1964) Canad. J. Math. , vol.16 , pp. 539-548
- Gilmore, P.C.¹ Hoffman, A.J.²

4
- 0026897421
- The vertex separation number of a graph equals its path-width
- N.G. Kinnersley The vertex separation number of a graph equals its path-width Inform. Process. Lett. 42 1992 345 350
- (1992) Inform. Process. Lett. , vol.42 , pp. 345-350
- Kinnersley, N.G.¹

5
- 0041361597
- Obstruction set isolation for the gate matrix layout problem
- N.G. Kinnersley, and M.A. Langston Obstruction set isolation for the gate matrix layout problem Discrete Appl. Math. 54 1992 169 213
- (1992) Discrete Appl. Math. , vol.54 , pp. 169-213
- Kinnersley, N.G.¹ Langston, M.A.²

6
- 0041532168
- Ph.D. Thesis, Universiteit Utrecht, Faculteit Wiskunde en Informatica
- T. Kloks, Treewidth, Ph.D. Thesis, Universiteit Utrecht, Faculteit Wiskunde en Informatica, 1993.
- (1993) Treewidth
- Kloks, T.¹

7
- 0002215434
- Representation of a finite graph by a set of intervals on the real line
- C.G. Lekkerkerker, and J.Ch. Boland Representation of a finite graph by a set of intervals on the real line Fund. Math. 51 1962 45 64
- (1962) Fund. Math. , vol.51 , pp. 45-64
- Lekkerkerker, C.G.¹ Boland, J.Ch.²

8
- 0041453672
- The structure and number of obstructions to treewidth
- S. Ramachandramurthi The structure and number of obstructions to treewidth SIAM J. Discrete Math. 10 1 1997 146 157 (Pubitemid 127619999)
- (1997) SIAM Journal on Discrete Mathematics , vol.10 , Issue.1 , pp. 146-157
- Ramachandramurthi, S.¹

10
- 0002848005
- Graph minors XIII: The disjoint paths problem
- N. Roberson, and P.D. Seymour Graph minors XIII: The disjoint paths problem J. Combin. Theory Ser. B 63 1995 65 100
- (1995) J. Combin. Theory Ser. B , vol.63 , pp. 65-100
- Roberson, N.¹ Seymour, P.D.²

11
- 5244373902
- Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia, June
- D.P. Sanders, Linear algorithms for graphs of tree-width at most four, Program of algorithms, combinatorics, and optimization, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia, June 1993.
- (1993) Linear Algorithms for Graphs of Tree-width at Most Four, Program of Algorithms, Combinatorics, and Optimization
- Sanders, D.P.¹

12
- 0030360116
- On linear recognition of tree-width at most four
- D.P. Sanders On linear recognization of tree-width at most four Siam J. Discrete Math. 9 1 1995 101 117 (Pubitemid 126579838)
- (1996) SIAM Journal on Discrete Mathematics , vol.9 , Issue.1 , pp. 101-117
- Sanders, D.P.¹

13
- 84987013464
- A characterization of partial 3-trees
- A. Satyanarayana, and L. Tung A characterization of partial 3-trees Networks 20 1990 299 322
- (1990) Networks , vol.20 , pp. 299-322
- Satyanarayana, A.¹ Tung, L.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.