SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 84, Issue 1-3, 1998, Pages 1-13

On the structure of graphs with few P4S

(2) Babel, Luitpold a Olariu, Stephan b

a TECHNICAL UNIVERSITY OF MUNICH (Germany)

b ECS Building (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042123228 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)90120-7 Document Type: Article

Times cited : (51)

References (17)

1
- 0003415652
- Addison-Wesley, Reading, MA
- A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 0005255830
- The isomorphism problem for directed path graphs and for rooted directed path graphs
- L. Babel, I.N. Ponomarenko, G. Tinhofer, The isomorphism problem for directed path graphs and for rooted directed path graphs, J. Algorithms 21 (1996) 542-564.
- (1996) J. Algorithms , vol.21 , pp. 542-564
- Babel, L.¹ Ponomarenko, I.N.² Tinhofer, G.³

3
- 85045609718
- 4-connected graphs
- to appear
- 4-connected graphs, Discrete Math., to appear.
- Discrete Math.
- Babel, L.¹

4
- 0041736428
- Report No. CS-77-04, Computer Science Department, University of Waterloo
- K.S. Booth, C.J. Colboum, Problems polynomially equivalent to graph isomorphism, Report No. CS-77-04, Computer Science Department, University of Waterloo, 1979.
- (1979) Problems Polynomially Equivalent to Graph Isomorphism
- Booth, K.S.¹ Colboum, C.J.²

5
- 0018455831
- A linear time algorithm for deciding interval graph isomorphism
- K.S. Booth, G.S. Lueker, A linear time algorithm for deciding interval graph isomorphism, J. ACM 26 (1979) 183-195.
- (1979) J. ACM , vol.26 , pp. 183-195
- Booth, K.S.¹ Lueker, G.S.²

6
- 77956924111
- Perfectly ordered graphs
- C. Berge, V. Chvatal (Eds.), North-Holland, Amsterdam
- V. Chvatal, Perfectly ordered graphs, in: C. Berge, V. Chvatal (Eds.), Topics on Perfect Graphs, North-Holland, Amsterdam, 1984, pp. 63-65.
- (1984) Topics on Perfect Graphs , pp. 63-65
- Chvatal, V.¹

7
- 0019590904
- Complement reducible graphs
- D.G. Corneil, H. Lerchs, L.S. Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
- (1981) Discrete Appl. Math. , vol.3 , pp. 163-174
- Corneil, D.G.¹ Lerchs, H.² Burlingham, L.S.³

8
- 0022162058
- A linear recognition algorithm for cographs
- D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985) 926-934.
- (1985) SIAM J. Comput. , vol.14 , pp. 926-934
- Corneil, D.G.¹ Perl, Y.² Stewart, L.K.³

9
- 0003947606
- Academic Press, New York
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

10
- 0040932979
- p-Components and the homogeneous decomposition of graphs
- B. Jamison, S. Olariu, p-Components and the homogeneous decomposition of graphs, SIAM J. Discrete Math. 8 (1995) 448-463.
- (1995) SIAM J. Discrete Math. , vol.8 , pp. 448-463
- Jamison, B.¹ Olariu, S.²

11
- 38249016129
- 4-sparse graphs
- 4-sparse graphs, Discrete Appl. Math. 35 (1992) 115-129.
- (1992) Discrete Appl. Math. , vol.35 , pp. 115-129
- Jamison, B.¹ Olariu, S.²

12
- 0041639537
- 4-sparse graphs in linear time
- 4-sparse graphs in linear time, SIAM J. Comput. 21 (1992) 381-406.
- (1992) SIAM J. Comput. , vol.21 , pp. 381-406
- Jamison, B.¹ Olariu, S.²

13
- 0011518472
- 4-reducible graphs, a class of uniquely tree representable graphs
- 4-reducible graphs, a class of uniquely tree representable graphs, Stud. Appl. Math. 81 (1989) 79-87.
- (1989) Stud. Appl. Math. , vol.81 , pp. 79-87
- Jamison, B.¹ Olariu, S.²

14
- 0039051495
- 4-extendible graphs
- 4-extendible graphs, Discrete Appl. Math. 34 (1991) 151-164.
- (1991) Discrete Appl. Math. , vol.34 , pp. 151-164
- Jamison, B.¹ Olariu, S.²

15
- 0004526870
- A new class of brittle graphs
- B. Jamison, S. Olariu, A new class of brittle graphs, Stud. in Appl. Math. 81 (1989) 89-92.
- (1989) Stud. in Appl. Math. , vol.81 , pp. 89-92
- Jamison, B.¹ Olariu, S.²

16
- 0042759153
- Isomorphism testing in hook-up graphs
- M.M. Klawe, M.M. Corneil, A. Proskurowski, Isomorphism testing in hook-up graphs, SIAM J. Algebraic Discrete Methods 3 (1982) 260-274.
- (1982) SIAM J. Algebraic Discrete Methods , vol.3 , pp. 260-274
- Klawe, M.M.¹ Corneil, M.M.² Proskurowski, A.³

17
- 0041757268
- Graphical algorithms and their complexity
- E.L. Lawler, Graphical algorithms and their complexity, Math. Center Tracts 81 (1976) 3-32.
- (1976) Math. Center Tracts , vol.81 , pp. 3-32
- Lawler, E.L.¹

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