Skip to main content
SpringerLink
Log in

Edge-face chromatic number of Halin-graphs

  • Letters
  • Published:
Chinese Science Bulletin

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Halin, R., Studies on minimally n-connected graph, inComb. Math. and Its Applications, Proc. Conf. Oxford, London: Academic Press, 1969.

    Google Scholar 

  2. Bondy, J. A., Murty, U. S. R.,Graph Theory with Applications, New York: Macmillan Press Ltd, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Lanzhou Railway Institute, 730070, Lanzhou, China

    Zhongfu Zhang, Xinzhong Lu & Linzhong Liu

  2. Institute of Applied Mathematics, Chinese Academy of Sciences, 100080, Beijing, China

    Jianfang Wang

  3. The Hefei Branch, Research Center of Computer Science, Chinese Academy of Sciences, 230031, Hefei, China

    Tongxin Gu

Authors
  1. Zhongfu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinzhong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Linzhong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianfang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tongxin Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Zhang, Z., Lu, X., Liu, L. et al. Edge-face chromatic number of Halin-graphs. Chin. Sci. Bull. 44, 189–190 (1999). https://doi.org/10.1007/BF02884750

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02884750

Keywords

Search

Navigation