Complexity of (p, 1)-total labelling

Discrete Applied Mathematics

Volumn 157, Issue 13, 2009, Pages 2859-2870

  Havet, Frédéric ^a   Thomassé, Stéphan ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b LIRMM   (France)

Author keywords

Distance constrained colouring; Total colouring; Total labelling

Indexed keywords

BIPARTITE GRAPHS; DISTANCE CONSTRAINED COLOURING; GRAPH G; MAXIMUM DEGREE; NP COMPLETE; NP-HARD; TOTAL COLOURING; TOTAL LABELLING; UPPER BOUND;

COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 67349198097     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.03.021     Document Type: Article

References (10)

1. Chang G.J., and Kuo D. The L (2, 1)-labeling problem on graphs. SIAM J. Discrete. Math. 9 (1996) 309-316
2. Fiala J., Kloks T., and Kratochvíl J. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 (2001) 59-72
3. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness. A Series of Books in the Mathematical Sciences (1979), W. H. Freeman and Co, San Francisco, CA
4. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 (1992) 586-595
5. Havet F., and Yu M.-L. (p, 1)-total labelling of graphs. Discrete Math. 308 (2008) 496-513
6. McDiarmid C.J., and Sánchez-Arroyo A. Total colouring regular bipartite graphs is NP-hard. Discrete Math. 124 (1994) 155-162
7. F.S. Roberts, Private communication to J. Griggs
8. Sánchez-Arroyo A. Determining the total colouring number is NP-hard. Discrete Math. 78 (1989) 315-319
9. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 216-226
10. Yeh R.K. A survey on labeling graphs with a condition at distance two. Discrete Math. 306 (2006) 1217-1231