Skip to main content
SpringerLink
Log in

Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let S ni be a star of size n i and let S=S n1∪…∪S nk≠S 2n−3∪S 1 or S 2∪S 2 be a spanning star-forest of the complete graph K 2n. We prove that K 2n has a proper (2n−1)-edge-colouring such that all the edges of S receive distinct colours. This result is very useful in the study of total-colourings of graphs.

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

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, 119260 Singapore, , , , , , SG

    H. P. Yap & Qizhang Liu

Authors
  1. H. P. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qizhang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: March 8, 1995 / Revised: May 16, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yap, H., Liu, Q. Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours. Graphs Comb 15, 249–255 (1999). https://doi.org/10.1007/s003730050045

Download citation

  • Issue Date:

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

Keywords

Search

Navigation