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

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 50, Issue 3, 1994, Pages 297-302

Algorithmic complexity of list colorings

(2) Kratochvíl, Jan a Tuza, Zsolt b

a CHARLES UNIVERSITY (Czech Republic)

b INSTITUTE OF EXPERIMENTAL MEDICINE (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149146651 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/0166-218X(94)90150-3 Document Type: Article

Times cited : (57)

References (18)

1
- 0000576339
- Colorings and orientations of graphs
- (1992) Combinatorica , vol.12 , pp. 125-134
- Alon¹ Tarsi²

2
- 0000038784
- Precoloring extension. I. Interval graphs
- (1992) Discrete Mathematics , vol.100 , pp. 267-279
- Biró¹ Hujter² Tuza³

3
- 84959695157
- On colouring the nodes of a network
- (1941) Mathematical Proceedings of the Cambridge Philosophical Society , vol.37 , pp. 194-197
- Brooks¹

4
- 0000307033
- Choosability in graphs
- (1979) Congr. Numer. , vol.26 , pp. 125-157
- Erdös¹ Rubin² Taylor³

5
- 84909879138
- M.R. Fellows, J. Kratochvil, M. Middendorf and F. Pfeiffer, The complexity of induced minors and related problems, Algorithmica, to appear.

6
- 0003603813
- Freeman, New York
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey¹ Johnson²

7
- 30244473678
- Some simplified NP-complete graph problems
- (1976) Theoret. Comput. Sci. , vol.1 , pp. 237-267
- Garey¹ Johnson² Stockmeyer³

8
- 0038282267
- Precoloring extension. II. Graph classes related to bipartite graphs
- (1993) Acta Math. Univ. Comenian. , vol.62 , pp. 1-11
- Hujter¹ Tuza²

9
- 84909860437
- M. Hujter and Zs. Tuza, Precoloring extension. III. Classes of perfect graphs, to appear.

10
- 84909841033
- M. Hujter and Zs. Tuza, Precoloring extension. IV. General bounds and list colorings, to appear.

11
- 0346982370
- Generalized coloring for tree-like graphs
- Lecture Notes in Computer Science, Springer, Berlin
- (1993) Proceedings 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’92) , vol.652 , pp. 50-59
- Jansen¹ Scheffler²

12
- 84909829146
- J. Kratochvíl, Precoloring extension with fixed color bound, Acta Math. Univ. Comenian., to appear.

13
- 0027542444
- One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
- (1993) SIAM Journal on Computing , vol.22 , pp. 203-210
- Kratochvíl¹ Savický² Tuza³

14
- 0002794707
- Planar Formulae and Their Uses
- (1982) SIAM Journal on Computing , vol.11 , pp. 329-343
- Lichtenstein¹

15
- 84909843656
- Every planar graph is 5-choosable
- (1993) Manuscript
- Thomassen¹

16
- 0002636933
- A simplified satisfiability problem
- (1984) Discrete Appl. Math. , vol.8 , pp. 85-89
- Tovey¹

17
- 0002221232
- Vertex colouring with given colors
- (in Russian)
- (1976) Discrete Anal. , vol.29 , pp. 3-10
- Vizing¹

18
- 43949166590
- List colourings of planar graphs
- (1993) Discrete Math. , vol.120 , pp. 215-219
- Voigt¹

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