Skip to main content
SpringerLink
Log in
Book cover

Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer Science

CCS 1995: Combinatorics and Computer Science pp 1–5Cite as

Equitable and m-bounded coloring of split graphs

  • Graph Theory
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1120))

Abstract

An equitable coloring of a graph is a proper coloring such that the sizes of color classes are as even as possible. An m-bounded coloring of a graph is a proper coloring such that the sizes of color classes are all bounded by a preassigned number m. Formulas for the equitable and m-bounded chromatic numbers of a split graph are established in this paper. It is proved that split graphs satisfy the equitable Δ-coloring conjecture in Chen, Lih and Wu [4].

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bollobás, B., Guy, R. K.: Equitable and proportional coloring of trees. J. Comb. Theory(B) 34 (1983) 177–186

    Article  Google Scholar 

  2. Chen, B. L., Lih, K. W.: A note on the m-bounded chromatic number of a tree. Europ. J. Comb. 14 (1993) 311–322

    Article  Google Scholar 

  3. Chen, B. L., Lih, K. W.: Equitable coloring of trees. J. Comb. Theory(B) 61 (1994) 83–87

    Article  Google Scholar 

  4. Chen, B. L., Lih, K. W., Wu, P. L.: Equtiable coloring and the maximum degree. Europ. J. Comb. 15 (1994) 443–447

    Article  Google Scholar 

  5. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdös. In Combinatorial Theory and Its Applications. Vol II (P. Erdös, A Rényi and V. T. Sós, eds), Colloq. Math. Soc. János Bolyai 4, North-Holland, Amsterdam (1970) 601–623

    Google Scholar 

  6. Lih, K. W., Wu, P. L.: On equitable coloring of bipartite graphs. Discrete Math. (to appear)

    Google Scholar 

  7. Meyer, W.: Equitable coloring. Amer. Math. Monthly 80 (1973) 920–922

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Tunghai University, 40704, Taiwan

    Bor-Liang Chen

  2. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Ming-Tat Ko

  3. Institute of Mathematics, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Ko-Wei Lih

Authors
  1. Bor-Liang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ming-Tat Ko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ko-Wei Lih
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Deza Reinhardt Euler Ioannis Manoussakis

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, BL., Ko, MT., Lih, KW. (1996). Equitable and m-bounded coloring of split graphs. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-61576-8_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61576-7

  • Online ISBN: 978-3-540-70627-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation