Skip to main content
SpringerLink
Log in

Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs

  • Conference paper
Computing and Combinatorics (COCOON 2012)

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

Included in the following conference series:

  • 1094 Accesses

Abstract

We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, L.: The Strong Chromatic Index of a Cubic Graph Is at Most 10. Discrete Math. 108, 231–252 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bandelt, H., Mulder, H.: Distance-hereditary Graphs. J. Comb. Theory B 41, 182–208 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cameron, K.: Induced Matchings. Discrete Appl. Math. 24, 97–102 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cameron, K.: Induced Matchings in Intersection Graphs. Discrete Math. 278, 1–9 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cameron, K., Sritharan, R., Tang, Y.: Finding a Maximum Induced Matching in Weakly Chordal Graphs. Discrete Math. 266, 133–142 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chang, M., Hsieh, S., Chen, G.: Dynamic Programming on Distance-hereditary Graphs. In: Leong, H.-V., Jain, S., Imai, H. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 344–353. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  7. Corneil, D., Perl, Y., Stewart, L.: A Linear Recognition Algorithm for Cographs. SIAM J. Comput. 14, 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dvořák, Z., Král, D.: Classes of Graphs with Small Rank Decompositions Are χ-bounded. Manuscript on ArXiv: 1107.2161.v1 (2011).

    Google Scholar 

  9. Fomin, F., Golovach, P.A., Lokshtanov, D., Saurabh, S.: On the Price of Generality. In: Proceedings of the 20th Annual-SIAM Symposium on Discrete Algorithms, pp. 825–834 (2009)

    Google Scholar 

  10. Ganian, R., Hliněný, P.: Better Polynomial Algorithms on Graphs of Bounded Rank-Width. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 266–277. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Halin, R.: Studies on Minimally n-connected Graphs. In: Welsh, D. (ed.) Combinatorial Mathematics and its Applications, pp. 129–136. Academic Press, London (1971)

    Google Scholar 

  12. Hayward, R., Spinrad, J., Sritharan, R.: Improved Algorithms for Weakly Chordal Graphs. ACM Trans. Alg. 3, 1549–6325 (2007)

    MathSciNet  Google Scholar 

  13. Howorka, E.: A Characterization of Distance-hereditary Graphs. Q. J. Math. 28, 417–420 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kloks, T.: Treewidth – Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  15. Lai, H., Lih, K., Tsai, P.: The Strong Chromatic Index of Halin Graphs. Discrete Math. 312, 1536–1541 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Laskar, R., Shier, D.: On Powers and Centers of Chordal Graphs. Discrete Appl. Math. 6, 139–147 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lih, K., Liu, D.: On the Strong Chromatic Index of Cubic Halin Graphs. Appl. Math. Lett. 25, 898–901 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Molloy, M., Reed, B.: A Bound on the Strong Chromatic Index of a Graph. J. Comb. Theory B. 69, 103–109 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Moser, M., Sikdar, S.: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. Discrete Appl. Math. 157, 715–727 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Salavatipour, M.: A Polynomial Algorithm for Strong Edge Coloring of Partial k-trees. Discrete Appl. Math. 143, 285–291 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Shiu, W., Lam, P., Tam, W.: On Strong Chromatic Index of Halin Graphs. J. Comb. Math. Comb. Comput. 57, 211–222 (2006)

    MathSciNet  MATH  Google Scholar 

  22. Shiu, W., Tam, W.: The Strong Chromatic Index of Complete Cubic Halin Graphs. Appl. Math. Lett. 22, 754–758 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  23. Wolk, E.: A Note on “The Comparability Graph of a Tree”. In: Proceedings of the American Mathematical Society, vol. 16, pp. 17–20 (1965)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan

    Ton Kloks, Sheung-Hung Poon & Chin-Ting Ung

  2. Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan

    Yue-Li Wang

Authors
  1. Ton Kloks
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheung-Hung Poon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Ting Ung
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yue-Li Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of IT, University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Joachim Gudmundsson , Julián Mestre  & Taso Viglas ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kloks, T., Poon, SH., Ung, CT., Wang, YL. (2012). Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds) Computing and Combinatorics. COCOON 2012. Lecture Notes in Computer Science, vol 7434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32241-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32241-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32240-2

  • Online ISBN: 978-3-642-32241-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation