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

메뉴 건너뛰기

Discrete Mathematics

Volumn 214, Issue 1-3, 2000, Pages 101-112

Variable degeneracy: Extensions of Brooks' and Gallai's theorems

(3) Borodin, O V a Kostochka, A V b Toft, B c

a SOBOLEV INSTITUTE OF MATHEMATICS (Russian Federation)

b NOVOSIBIRSK STATE UNIVERSITY (Russian Federation)

c UNIVERSITY OF SOUTHERN DENMARK (Denmark)

Author keywords

Degeneracy; Graph colouring; List colouring; Point partition numbers; Vertex function

Indexed keywords

EID: 0347647633 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(99)00221-6 Document Type: Article

Times cited : (48)

References (17)

1
- 26344468015
- Optimal vertex partition
- B. Bollobás, B. Manvel, Optimal vertex partition, Bull. London Math. Soc. 11 (1979) 113-116.
- (1979) Bull. London Math. Soc. , vol.11 , pp. 113-116
- Bollobás, B.¹ Manvel, B.²

2
- 0006762411
- On decomposition of graphs into degenerate subgraphs
- in Russian
- O.V. Borodin, On decomposition of graphs into degenerate subgraphs, Metody Diskret. Analiz 28 (1976) 3-11 (in Russian).
- (1976) Metody Diskret. Analiz , vol.28 , pp. 3-11
- Borodin, O.V.¹

3
- 0042176066
- Criterion of chromaticity of a degree prescription
- Novosibirsk, (in Russian)
- O.V. Borodin, Criterion of chromaticity of a degree prescription, Abstracts of IV All-Union Conference on Theoretical Cybernetics, Novosibirsk, 1977, pp. 127-128 (in Russian).
- (1977) Abstracts of IV All-union Conference on Theoretical Cybernetics , pp. 127-128
- Borodin, O.V.¹

4
- 0004111359
- Ph.D.Thesis, Novosibirsk, (in Russian)
- O.V. Borodin, Problems of colouring and of covering the vertex set of a graph by induced subgraphs Ph.D.Thesis, Novosibirsk, 1979 (in Russian).
- (1979) Problems of Colouring and of Covering the Vertex Set of a Graph by Induced Subgraphs
- Borodin, O.V.¹

5
- 0003490401
- On an upper bound of a graph's chromatic number, depending on the graph's degree and density
- O.V. Borodin, A.V. Kostochka, On an upper bound of a graph's chromatic number, depending on the graph's degree and density, J. Combin. Theory Ser. B 23 (1977) 247-250.
- (1977) J. Combin. Theory Ser. B , vol.23 , pp. 247-250
- Borodin, O.V.¹ Kostochka, A.V.²

6
- 0000307033
- Choosability in graphs
- P. Erdos, A. Rubin, H. Taylor, Choosability in graphs, Congr. Numer. 26 (1979) 125-157.
- (1979) Congr. Numer. , vol.26 , pp. 125-157
- Erdos, P.¹ Rubin, A.² Taylor, H.³

7
- 85163172268
- A six-color theorem
- F. Franklin, A six-color theorem, J. Math. Phys. 13 (1934) 363-369.
- (1934) J. Math. Phys. , vol.13 , pp. 363-369
- Franklin, F.¹

8
- 0001019661
- Kritische graphen I
- T. Gallai, Kritische Graphen I, Publ. Math. Inst. Hungar. Acad. Sci. 8 (1963) 165-192.
- (1963) Publ. Math. Inst. Hungar. Acad. Sci. , vol.8 , pp. 165-192
- Gallai, T.¹

9
- 26344465557
- Szinezesi problemacrol
- L. Gerencsér, Szinezesi problemacrol, Mat. Lapok 16 (1965) 274-277.
- (1965) Mat. Lapok , vol.16 , pp. 274-277
- Gerencsér, L.¹

10
- 84959769650
- Critical point-arboritic graphs
- H.V. Kronk, J. Mitchem, Critical point-arboritic graphs, J. London Math. Soc. 9 (1975) 459-466.
- (1975) J. London Math. Soc. , vol.9 , pp. 459-466
- Kronk, H.V.¹ Mitchem, J.²

11
- 0043169183
- k-degenerate graphs
- D.R. Lick, A.T. White, k-degenerate graphs, Canad. J. Math. 22 (1970) 1082-1096.
- (1970) Canad. J. Math. , vol.22 , pp. 1082-1096
- Lick, D.R.¹ White, A.T.²

12
- 0348096288
- The point partition numbers of closed 2-manifolds
- D.R. Lick, A.T. White, The point partition numbers of closed 2-manifolds, J. London Math. Soc. 4 (1972) 577-583.
- (1972) J. London Math. Soc. , vol.4 , pp. 577-583
- Lick, D.R.¹ White, A.T.²

13
- 0013497816
- On decomposition of graphs
- L. Lovász, On decomposition of graphs, Studia Sci. Math. Hungar. 1 (1966) 237-238.
- (1966) Studia Sci. Math. Hungar. , vol.1 , pp. 237-238
- Lovász, L.¹

14
- 0347466373
- An extension of Brooks' theorem to n-degenerate graphs
- J. Mitchem, An extension of Brooks' theorem to n-degenerate graphs, Discrete Math. 17 (1977) 291-298.
- (1977) Discrete Math. , vol.17 , pp. 291-298
- Mitchem, J.¹

15
- 0006840702
- Decomposing a planar graph into degenerate graphs
- C. Thomassen, Decomposing a planar graph into degenerate graphs, J. Combin. Theory Ser. B 65 (1995) 305-314.
- (1995) J. Combin. Theory Ser. B , vol.65 , pp. 305-314
- Thomassen, C.¹

16
- 0003005975
- Every planar graph is 5-choosable
- C. Thomassen, Every planar graph is 5-choosable, J. Combin Theory Ser. B 62 (1994) 180-181.
- (1994) J. Combin Theory Ser. B , vol.62 , pp. 180-181
- Thomassen, C.¹

17
- 0002221232
- Vertex colourings with given colours
- in Russian
- V.G. Vizing, Vertex colourings with given colours Metody Diskret. Analiz 29 (1976) 3-10 (in Russian).
- (1976) Metody Diskret. Analiz , vol.29 , pp. 3-10
- Vizing, V.G.¹

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