SCOPUS 정보 검색 플랫폼

Discrete Mathematics

Volumn 309, Issue 10, 2009, Pages 3270-3279

The complexity of the L (p, q)-labeling problem for bipartite planar graphs of small degree

(3) Janczewski, Robert a Kosowski, Adrian a Małafiejski, Michał a

a GDANSK UNIVERSITY OF TECHNOLOGY (Poland)

Author keywords

Bipartite graphs; Graphs of small degree; L (p, q) labeling; Planar graphs

Indexed keywords

BIPARTITE GRAPHS; GRAPH G; GRAPHS OF SMALL DEGREE; L (P, Q)-LABELING; L(2 , 1)-LABELING; MAXIMUM DEGREES; NON-NEGATIVE INTEGERS; P-COMPLETE; PLANAR GRAPHS;

GRAPH THEORY;

LABELING;

EID: 67349216608 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/j.disc.2008.09.028 Document Type: Article

Times cited : (10)

References (12)

1
- 0142075417
- On powers of chordal graphs and their colorings
- Agnarsson G., Greenlaw R., and Halldórsson M.M. On powers of chordal graphs and their colorings. Congressus Numer. 144 (2000) 41-65
- (2000) Congressus Numer. , vol.144 , pp. 41-65
- Agnarsson, G.¹ Greenlaw, R.² Halldórsson, M.M.³

2
- 1542303740
- Approximations for λ-coloring of graphs
- Bodlaender H.L., Kloks T., van Leeuwen J., and Tan R.B. Approximations for λ-coloring of graphs. The Comput. J. 47 (2004) 193-204
- (2004) The Comput. J. , vol.47 , pp. 193-204
- Bodlaender, H.L.¹ Kloks, T.² van Leeuwen, J.³ Tan, R.B.⁴

3
- 33750117332
- The L (h, k)-labelling problem: An annotated bibliography
- Calamoneri T. The L (h, k)-labelling problem: An annotated bibliography. The Comput. J. 49 (2006) 585-608
- (2006) The Comput. J. , vol.49 , pp. 585-608
- Calamoneri, T.¹

4
- 0030367240
- The L (2, 1)-labeling problem on graphs
- Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
- (1996) SIAM J. Discrete Math. , vol.9 , pp. 309-316
- Chang, G.J.¹ Kuo, D.²

5
- 49049099021
- Computational complexity of the distance constrained labelling problem for trees
- Proc. ICALP 2008, Springer
- Fiala J., Golovach P., and Kratochvil J. Computational complexity of the distance constrained labelling problem for trees. Proc. ICALP 2008. LNCS vol. 5125 (2008), Springer 294-305
- (2008) LNCS , vol.5125 , pp. 294-305
- Fiala, J.¹ Golovach, P.² Kratochvil, J.³

6
- 2442664109
- Fixed-parameter complexity of λ-labelings
- Fiala J., Kloks T., and Kratochvil J. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 (2001) 59-72
- (2001) Discrete Appl. Math. , vol.113 , pp. 59-72
- Fiala, J.¹ Kloks, T.² Kratochvil, J.³

7
- 30244473678
- Some simplified N P-complete graph problems
- Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified N P-complete graph problems. Theoret. Comput. Sci. 1 (1976) 237-267
- (1976) Theoret. Comput. Sci. , vol.1 , pp. 237-267
- Garey, M.R.¹ Johnson, D.S.² Stockmeyer, L.³

8
- 0037566612
- Generalized vertex labelings with a condition at distance two
- Georges J.P., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congressus Numer. 109 (1995) 141-159
- (1995) Congressus Numer. , vol.109 , pp. 141-159
- Georges, J.P.¹ Mauro, D.W.²

9
- 0019213982
- Frequency assignment: Theory and applications
- Hale W.K. Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514
- (1980) Proc. IEEE , vol.68 , pp. 1497-1514
- Hale, W.K.¹

10
- 0020765471
- Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem
- McCormick S.T. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program. 26 (1983) 153-171
- (1983) Math. Program. , vol.26 , pp. 153-171
- McCormick, S.T.¹

11
- 0035643134
- Hard tiling problems with simple tiles
- Moore C., and Robson J.M. Hard tiling problems with simple tiles. Discrete Computat. Geom. 26 (2001) 573-590
- (2001) Discrete Computat. Geom. , vol.26 , pp. 573-590
- Moore, C.¹ Robson, J.M.²

12
- 33747032334
- A survey on labeling graphs with a condition at distance two
- Yeh R.K. A survey on labeling graphs with a condition at distance two. Discrete Math. 306 (2006) 1217-1231
- (2006) Discrete Math. , vol.306 , pp. 1217-1231
- Yeh, R.K.¹

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