SCOPUS 정보 검색 플랫폼

Volumn 146, Issue 1-3, 1995, Pages 325-328

A not 3-choosable planar graph without 3-cycles

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011521158 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/0012-365X(94)00180-9 Document Type: Article

Times cited : (120)

References (12)

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

3
- 0000318572
- Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel
- Wiss. Zeitschrift der Universität Halle
- (1958) Math.-nat. VIII/1 , pp. 109-119
- Grötzsch¹

4
- 84921222811
- J. Kratochvil and Z. Tuza, Algorithmic complexity of list coloring, Discrete Appl. Math., to appear.

5
- 0011318003
- 3-choosable complete bipartite graphs
- (1991) DIMACS, Tech. Report 91-62
- Mahadev¹ Roberts² Santhanakrishnan³

6
- 0043267217
- From garbage to rainbows, generalizations of graphs coloring and their applications
- (1988) RUTCOR Research Report 36–88
- Roberts¹

7
- 84921186990
- New directions in graph theory
- Ann. Discrete Math.
- (1993) Quo vadis, Graph Theory? , vol.55
- Roberts¹

8
- 0042368629
- Every planar graph is 5-choosable
- Mathematical Institut, The Technical University of Denmark, Lyngby
- (1993) MAT-REPORT No. 1993-24
- Thomassen¹

9
- 0041867690
- 3-List-coloring planar graphs of girth 5
- Mathematical Institut, The Technical University of Denmark, Lyngby
- (1994) MAT-REPORT No. 1994-12
- Thomassen¹

10
- 0002221232
- Coloring the vertices of a graph in prescribed colors
- (1976) Diskret. Analiz No. 29 Metody Diskret. Anal. v Teorii Kodov i Shem , pp. 3-10
- Vizing¹

11
- 0002221232
- Coloring the vertices of a graph in prescribed colors
- (in Russian)
- (1976) Diskret. Analiz No. 29 Metody Diskret. Anal. v Teorii Kodov i Shem , pp. 101
- Vizing¹

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

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