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

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 71, Issue 1, 1997, Pages 1-16

Covering regular graphs

(3) Kratochvíl, Jan a,b Proskurowski, Andrzej b Telle, Jan Arne c

a CHARLES UNIVERSITY (Czech Republic)

b UNIVERSITY OF OREGON (United States)

c UNIVERSITY OF BERGEN (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031234618 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1006/jctb.1996.1743 Document Type: Article

Times cited : (47)

References (18)

1
- 0010994892
- On the complexity and combinatorics of covering finite complexes
- Abello J., Fellows M. R., Stillwell J. C. On the complexity and combinatorics of covering finite complexes. Austral. J. Combin. 4:1991;103-112.
- (1991) Austral. J. Combin. , vol.4 , pp. 103-112
- Abello, J.¹ Fellows, M.R.² Stillwell, J.C.³

2
- 84944076702
- Local and global properties in networks of processors
- D. Angluin, 1980, Local and global properties in networks of processors, Proceedings of the 12th ACM Symposium on Theory of Computing, 82, 93.
- (1980) Proceedings of the 12th ACM Symposium on Theory of Computing , pp. 82
- Angluin, D.¹

3
- 0010999662
- Finite common coverings of pairs of regular graphs
- Angluin D., Gardner A. Finite common coverings of pairs of regular graphs. J. Combin. Theory Ser. B. 30:1981;184-187.
- (1981) J. Combin. Theory Ser. B , vol.30 , pp. 184-187
- Angluin, D.¹ Gardner, A.²

4
- 0004242420
- Cambridge: Cambridge Univ. Press
- Biggs N. Algebraic Graph Theory. 1974;Cambridge Univ. Press, Cambridge.
- (1974) Algebraic Graph Theory
- Biggs, N.¹

5
- 0011029078
- Homological coverings of graphs
- Biggs N. Homological coverings of graphs. J. London Math. Soc. (2). 30:1984;1-14.
- (1984) J. London Math. Soc. (2) , vol.30 , pp. 1-14
- Biggs, N.¹

6
- 38149145996
- Coverings and minors: Applications to local computations in graphs
- Courcelle B., Métivier Y. Coverings and minors: Applications to local computations in graphs. European J. Combin. 15:1994;127-138.
- (1994) European J. Combin. , vol.15 , pp. 127-138
- Courcelle, B.¹ Métivier, Y.²

7
- 0010963697
- J. Fiala, 1997, Covers of Graphs.
- (1997) Covers of Graphs
- Fiala, J.¹

8
- 0004127488
- New York: Freeman
- Garey M. R., Johnson D. S. Computers and Intractability. 1978;Freeman, New York.
- (1978) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

9
- 0004161410
- New York: Wiley
- Gross J. L., Tucker T. W. Topological Graph Theory. 1987;Wiley, New York.
- (1987) Topological Graph Theory
- Gross, J.L.¹ Tucker, T.W.²

10
- 0000391793
- Generating all graph coverings by permutation voltage assignments
- Gross J. L., Tucker T. W. Generating all graph coverings by permutation voltage assignments. Discrete Math. 18:1977;273-283.
- (1977) Discrete Math. , vol.18 , pp. 273-283
- Gross, J.L.¹ Tucker, T.W.²

11
- 0010958212
- Groups and monoids of regular graphs (and of graphs with bounded degrees)
- Hell P., Nešetřil J. Groups and monoids of regular graphs (and of graphs with bounded degrees). Canad. J. Math. 25:1973;239-251.
- (1973) Canad. J. Math. , vol.25 , pp. 239-251
- Hell, P.¹ Nešetřil, J.²

12
- 38149144928
- Isomorphisms and automorphisms of graph coverings
- Hofmeister M. Isomorphisms and automorphisms of graph coverings. Discrete Math. 98:1991;175-183.
- (1991) Discrete Math. , vol.98 , pp. 175-183
- Hofmeister, M.¹

13
- 0002481773
- On the complexity ofH
- Hell P., Nešetřil J. On the complexity ofH. J. Combin. Theory Ser. B. 48:1990;92-110.
- (1990) J. Combin. Theory Ser. B , vol.48 , pp. 92-110
- Hell, P.¹ Nešetřil, J.²

14
- 0000429528
- The NP-completeness of edge-coloring
- Holyer I. The NP-completeness of edge-coloring. SIAM J. Comput. 4:1981;718-720.
- (1981) SIAM J. Comput. , vol.4 , pp. 718-720
- Holyer, I.¹

15
- 23544436253
- On the complexity of graph covering problems
- Kratochvíl J., Proskurowski A., Telle J. A. On the complexity of graph covering problems. Lecture Notes in Computer Science. 903:1995;93-105.
- (1995) Lecture Notes in Computer Science , vol.903 , pp. 93-105
- Kratochvíl, J.¹ Proskurowski, A.² Telle, J.A.³

16
- 0003016471
- NP-completeness of finding the chromatic index of regular graphs
- Leven D., Galil Z. NP-completeness of finding the chromatic index of regular graphs. J. Algorithms. 4:1983;35-44.
- (1983) J. Algorithms , vol.4 , pp. 35-44
- Leven, D.¹ Galil, Z.²

17
- 0004118098
- New York: Harcourt, Brance and World
- Massey W. Algebraic Topology: An Introduction. 1967;Harcourt, Brance and World, New York.
- (1967) Algebraic Topology: An Introduction
- Massey, W.¹

18
- 0010965252
- Homomorphism of derivative graphs
- Nešetřil J. Homomorphism of derivative graphs. Discrete Math. 1:1971;257-268.
- (1971) Discrete Math. , vol.1 , pp. 257-268
- Nešetřil, J.¹

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