Skip to main content
SpringerLink
Log in

Trees, Paths, Stars, Caterpillars and Spiders

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9486))

  • 1025 Accesses

Abstract

For any \(k \ge 2\), deciding whether the linear arboricity, star arboricity, caterpillar arboricity, and spider arboricity, respectively, of a bipartite graph are at most k are all NP-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III: cyclic and acyclic invariants. Math. Slovoca 30, 405–417 (1980)

    MathSciNet  MATH  Google Scholar 

  2. Alon, N.: The linear arboricity of graphs. Israel J. Math. 62, 311–325 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cygan, M., Hou, J., Kowalik, Ł., Lužar, B., Wu, J.: A planar linear arboricity conjecture. J. Graph Theor. 69, 403–425 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fiala, J., Jansen, K., Le, V.B., Seidel, E.: Graph subcolorings: complexity and algorithms. SIAM J. Discrete Math. 16, 635–650 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gabow, H.N., Westermann, H.H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7, 465–497 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gimbel, J., Hartman, C.: Subcolorings and the subchromatic number of a graph. Discrete Math. 272, 139–154 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gonçalves, D.: Caterpillar arboricity of planar graphs. Discrete Math. 307, 2112–2121 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gonçalves, D., Ochem, P.: On star and caterpillar arboricity. Discrete Math. 309, 3694–3702 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hakimi, S.L., Mitchem, J., Schmeichel, E.: Star arboricity of graphs. Discrete Math. 149, 93–98 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jiang, M.: Recognizing \(d\)-interval graphs and \(d\)-track interval graphs. Algorithmica 66, 541–563 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19, 104–115 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lovász, L.: Coverings and colorings of hypergraphs. In: Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 3–12. Utilitas Mathematica Publishing, Winnipeg (1973)

    Google Scholar 

  13. Maffray, F., Preissmann, M.: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs. Discrete Math. 162, 313–317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  15. Peroche, B.: Complexité de l’arboricité linéaire d’un graphe. RAIRO Recherche Operationelle 16, 125–129 (1982)

    MathSciNet  MATH  Google Scholar 

  16. Shermer, T.C.: On rectangle visibility graphs III: external visibility and complexity. In: Proceedings of the 8th Canadian Conference on Computational Geometry (CCCG 1996), pp. 234–239 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utah State University, Logan, UT, 84322, USA

    Minghui Jiang

Authors
  1. Minghui Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minghui Jiang .

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, Pennsylvania, USA

    Zaixin Lu

  2. North Carolina Central University, Durham, North Carolina, USA

    Donghyun Kim

  3. University of Texas at Dallas, Richardson, Texas, USA

    Weili Wu

  4. Texas Southern University, Houston, Texas, USA

    Wei Li

  5. University of Texas at Dallas, Richardson, Texas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Jiang, M. (2015). Trees, Paths, Stars, Caterpillars and Spiders. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation