Abstract
We characterize all graphs that have carving-width at most k for k = 1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immersion obstruction set for graphs of carving-width at most 3.
This is a preview of subscription content, log in via an institution to check access.
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
Abu-Khzam, F.N., Langston, M.A.: Graph Coloring and the Immersion Order. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 394–403. Springer, Heidelberg (2003)
Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods 7(2), 305–314 (1986)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209(1-2), 1–45 (1998)
Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms 32(2), 167–194 (1999)
DeVos, M., Dvořák, Z., Fox, J., McDonald, J., Mohar, B., Scheide, D.: Minimum degree condition forcing complete graph immersion. CoRR, arXiv:1101.2630 (January 2011)
Diestel, R.: Graph Theory, Electronic edn. Springer (2005)
Dvořák, Z., Giannopoulou, A.C., Thilikos, D.M.: Forbidden graphs for tree-depth. European Journal of Combinatorics 33(5), 969–979 (2012)
Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of STOC 2011, pp. 479–488. ACM (2011)
Kawarabayashi, K., Kobayashi, Y.: List-coloring graphs without subdivisions and without immersions. In: Proceedings of SODA 2012, pp. 1425–1435. SIAM (2012)
Khuller, S., Raghavachari, B., Young, N.: Designing multicommodity flow trees. Information Processing Letters 50, 49–55 (1994)
Koutsonas, A., Thilikos, D.M., Yamazaki, K.: Outerplanar obstructions for matroid pathwidth. Electronic Notes in Discrete Mathematics 38, 541–546 (2011)
Robertson, N., Seymour, P.D., Thomas, R.: Linkless embeddings of graphs in 3-space. Bull. Amer. Math. Soc. 28, 84–89 (1993)
Robertson, N., Seymour, P.D.: Graph minors XXIII. Nash-Williams’ immersion conjecture. Journal of Combinatorial Theory, Series B 100, 181–205 (2010)
Rué, J., Stavropoulos, K.S., Thilikos, D.M.: Outerplanar obstructions for a feedback vertex set. European Journal of Combinatorics 33, 948–968 (2012)
Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)
Takahashi, A., Ueno, S., Kajitani, Y.: Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Mathematics 127, 293–304 (1994)
Thilikos, D.M.: Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Mathematics 105, 239–271 (2000)
Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 192–203. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belmonte, R., van ’t Hof, P., Kamiński, M., Paulusma, D., Thilikos, D.M. (2012). Characterizing Graphs of Small Carving-Width. In: Lin, G. (eds) Combinatorial Optimization and Applications. COCOA 2012. Lecture Notes in Computer Science, vol 7402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31770-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-31770-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31769-9
Online ISBN: 978-3-642-31770-5
eBook Packages: Computer ScienceComputer Science (R0)