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

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 91, Issue 1-3, 1999, Pages 127-141

The b-chromatic number of a graph

(2) Irving, Robert W a Manlove, David F a

a UNIVERSITY OF GLASGOW (United Kingdom)

Author keywords

Achromatic; B chromatic; Colouring; Complexity; Graph

Indexed keywords

EID: 9344236520 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(98)00146-2 Document Type: Article

Times cited : (217)

References (16)

1
- 0024964564
- Achromatic number is NP-complete for cographs and interval graphs
- H.L. Bodlaender, Achromatic number is NP-complete for cographs and interval graphs, Inform. Process. Lett. 31 (1989) 135-138.
- (1989) Inform. Process. Lett. , vol.31 , pp. 135-138
- Bodlaender, H.L.¹

2
- 0031517582
- Some results on the achromatic number
- N. Cairnie, K. Edwards, Some results on the achromatic number, J. Graph Theory 26 (1997) 129-136.
- (1997) J. Graph Theory , vol.26 , pp. 129-136
- Cairnie, N.¹ Edwards, K.²

3
- 0030735705
- Approximation algorithms for the achromatic number
- ACM-SIAM
- A. Chaudhary, S. Vishwanathan, Approximation algorithms for the achromatic number, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 1997, pp. 557-562.
- (1997) Proc. 8th ACM-SIAM Symp. on Discrete Algorithms , pp. 557-562
- Chaudhary, A.¹ Vishwanathan, S.²

4
- 38249018742
- On the computational complexity of upper fractional domination
- G.A. Cheston, G. Fricke, S.T. Hedetniemi, D.P. Jacobs. On the computational complexity of upper fractional domination, Discrete Appl. Math. 27 (1990) 195-207.
- (1990) Discrete Appl. Math. , vol.27 , pp. 195-207
- Cheston, G.A.¹ Fricke, G.² Hedetniemi, S.T.³ Jacobs, D.P.⁴

5
- 0141879287
- Some perfect coloring properties of graphs
- C.A. Christen, S.M. Selkow, Some perfect coloring properties of graphs, J. Combin. Theory, Ser. B 27 (1979) 49-59.
- (1979) J. Combin. Theory, Ser. B , vol.27 , pp. 49-59
- Christen, C.A.¹ Selkow, S.M.²

6
- 0003236983
- Concerning the achromatic number of a graph
- M. Farber, G. Hahn, P. Hell, D. Miller, Concerning the achromatic number of a graph, J. Combin. Theory, Ser. B 40 (1986) 21-39.
- (1986) J. Combin. Theory, Ser. B , vol.40 , pp. 21-39
- Farber, M.¹ Hahn, G.² Hell, P.³ Miller, D.⁴

7
- 0004127488
- Freeman, San Francisco, CA
- M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, CA, 1979.
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

8
- 0027607736
- Approximating the minimum maximal independence number
- M.M. Halldórsson, Approximating the minimum maximal independence number. Inform. Process. Lett. 46 (1993) 169-172.
- (1993) Inform. Process. Lett. , vol.46 , pp. 169-172
- Halldórsson, M.M.¹

9
- 84986520419
- Maximum versus minimum invariants for graphs
- F. Harary, Maximum versus minimum invariants for graphs. J. Graph Theory 7 (1983) 275-284.
- (1983) J. Graph Theory , vol.7 , pp. 275-284
- Harary, F.¹

10
- 9344247296
- The achromatic number of a graph
- F. Harary, S. Hedetniemi, The achromatic number of a graph, J. Combin. Theory 8 (1970) 154 161.
- (1970) J. Combin. Theory , vol.8 , pp. 154161
- Harary, F.¹ Hedetniemi, S.²

11
- 0000009381
- An interpolation theorem for graphical homomorphisms
- F. Harary, S. Hedetniemi, G. Prins, An interpolation theorem for graphical homomorphisms, Portugal. Math. 26 (1967) 453-462.
- (1967) Portugal. Math. , vol.26 , pp. 453-462
- Harary, F.¹ Hedetniemi, S.² Prins, G.³

12
- 0013478238
- Irredundance in graphs - A survey
- S.T. Hedetniemi, R.C. Laskar, J. Pfaff, Irredundance in graphs - a survey, Cong. Numer. 48 (1985) 183-193.
- (1985) Cong. Numer. , vol.48 , pp. 183-193
- Hedetniemi, S.T.¹ Laskar, R.C.² Pfaff, J.³

13
- 0042776827
- The achromatic number of graphs: A survey and some new results
- F. Hughes, G. MacGillivray, The achromatic number of graphs: a survey and some new results. Bull. Inst. Combin. Appl. 19 (1997) 27-56.
- (1997) Bull. Inst. Combin. Appl. , vol.19 , pp. 27-56
- Hughes, F.¹ MacGillivray, G.²

14
- 0026103714
- On approximating the minimum independent dominating set
- R.W. Irving, On approximating the minimum independent dominating set. Inform. Process. Lett. 37 (1991) 197-200.
- (1991) Inform. Process. Lett. , vol.37 , pp. 197-200
- Irving, R.W.¹

15
- 0006764107
- Ph.D. Thesis, University of Glasgow, Department of Computing Science
- D.F. Manlove, Minimaximal and maximinimal optimisation problems: a partial order-based approach, Ph.D. Thesis, University of Glasgow, Department of Computing Science, 1998.
- (1998) Minimaximal and Maximinimal Optimisation Problems: A Partial Order-based Approach
- Manlove, D.F.¹

16
- 0001559260
- Edge dominating sets in graphs
- M. Yannakakis, F. Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math. 18(1) (1980) 364-372.
- (1980) SIAM J. Appl. Math. , vol.18 , Issue.1 , pp. 364-372
- Yannakakis, M.¹ Gavril, F.²

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