Abstract
We prove that the L(2,1)-labeling problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one from treewidth two. We prove similar results for other variants of the distance constrained graph labeling problem.
Research supported in part by project KONTAKT 525 — DIMACS-DIMATIA-Rényi Cooperation in Discrete Mathematics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Proskurowski, A.: Characterization and recognition of partial k-trees. Congr. Numerantium 47, 69–75 (1985)
Bodlaender, H.: Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial k-trees. J. Algorithms 11, 631–643 (1990)
Bodlaender, H.: A tourist guide through treewidth. Acta Cybern. 11, 1–21 (1993)
Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9(2), 309–316 (1996)
Courcelle, B.: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
Fellows, M.R., Kratochvíl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13, 266–282 (1995)
Fiala, J., Kloks, T., Kratochvíl, J.: Fixed-parameter complexity of λ-labelings. Discrete Applied Math. 113, 59–72 (2001)
Fiala, J., Kratochvíl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 537–549. Springer, Heidelberg (2001)
Fiala, J., Kratochvíl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory 22, 89–99 (2002)
Fiala, J., Kratochvíl, J., Proskurowski, A.: Distance constrained labelings of precolored trees. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 285–292. Springer, Heidelberg (2001)
Fiala, J., Kratochvíl, J., Proskurowski, A.: Systems of distant representatives. Discrete Applied Mathematics 145(2), 306–316 (2005)
Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477–495 (1978)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1979)
Golovach, P.A.: Systems of pairs of q-distant representatives and graph colorings. Zap. nau. sem. POMI 293, 5–25 (2002)
Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5(4), 586–595 (1992)
Král, D., Skrekovski, R.: A theorem about the channel assignment problem. SIAM J. Discrete Math. 16(3), 426–437 (2003)
Leese, R.A., Noble, S.D.: Cyclic labellings with constraints at two distances. Electr. J. Comb. 11(1) (2004)
Liu, D., Zhu, X.: Circular Distance Two Labelings and Circular Chromatic Numbers. Ars Combin. 69(4), 177–183 (2003)
McDiarmid, C., Reed, B.: Channel assignment on graphs of bounded treewidth. Discrete Math. 273(1-3), 183–192 (2003)
Monien, B., Sudborough, I.H.: Min Cut is NP-Complete for Edge Weigthed Trees. Theor. Comput. Sci. 58(1-3), 209–229 (1988)
Roberts, F.S. private communication to J. Griggs
Robertson, N., Seymour, P.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B 35, 39–61 (1983)
Proskurowski, A.: Separating subgraphs in k-trees: cables and caterpillars. Discrete Math. 49, 275–285 (1984)
van den Heuvel, J., Leese, R.A., Shepherd, M.: Graph labeling and radio channel assignment. Journal of Graph Theory 29(4), 263–283 (1998)
Yannakakis, M.: A polynomial algoritm for the min-cut linear arrangements of trees. J. ACM 32, 950–988 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiala, J., Golovach, P.A., Kratochvíl, J. (2005). Distance Constrained Labelings of Graphs of Bounded Treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_30
Download citation
DOI: https://doi.org/10.1007/11523468_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)