Skip to main content
SpringerLink
Log in

On the chromatic uniqueness of the graphW(n, n − 2, k)

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

This paper shows that the graphW(n, n − 2, k) is chromatically unique for any even integern ≥ 6 and any integerk ≥ 1.

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

Similar content being viewed by others

References

  1. Chia, G.L.: The chromaticity of wheels with a missing spokes. Discrete Math.82, 209–212 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dirac, G.A.: On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg,25, 71–76 (1967)

    Article  MathSciNet  Google Scholar 

  3. Dong, F.M.: On the chromatic uniqueness of generalized wheel graphs, J. Mathematical Research and Exposition (in Chinese),10, 447–454 (1990)

    MATH  Google Scholar 

  4. Koh, K.M., Teo, K.L.: The search for chromatic unique graphs, Graphs and Combinatorics6, 259–285 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Liu Yanpei, Graph Theory and Algorithm, (in Chinese), Chinese Academy of Sciences (1981)

Download references

Author information

Author notes

  1. F. M. Dong

    Present address: Department of Mathematics, National University of Singapore, 119260, Singapore

  2. Y. P. Liu

    Present address: Department of Mathematics, Northern Jiaotong University, 100040, Beijing, P. R. China

Authors and Affiliations

  1. Institute of Applied Mathematics, Chinese Academy of Sciences, 100080, Beijing, P. R. China

    F. M. Dong & Y. P. Liu

Authors
  1. F. M. Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. P. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, F.M., Liu, Y.P. On the chromatic uniqueness of the graphW(n, n − 2, k) . Graphs and Combinatorics 12, 221–230 (1996). https://doi.org/10.1007/BF01858456

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation