Skip to main content
SpringerLink
Log in

Edge-colorings of graphs — A survey

  • Conference paper
  • First Online:
Theory and Applications of Graphs

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 642))

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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. L. W. Beineke and S. Fiorini, On small graphs critical with respect to edge colourings, Discrete Math. (to appear).

    Google Scholar 

  2. L. W. Beineke and R. J. Wilson, On the edge-chromatic number of a graph, Discrete Math. 5 (1973), 15–20.

    Article  MathSciNet  MATH  Google Scholar 

  3. N. Biggs, An edge-colouring problem, Amer. Math. Monthly 79 (1972), 1018–1020.

    Article  MathSciNet  Google Scholar 

  4. F. Castagna and G. Prins, Every generalized Petersen graph has a Tait coloring, Pacific J. Math. 40 (1972), 53–58.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Erdös and R J. Wilson, On the chromatic index of almost all graphs, J. Combinatorial Theory (to appear).

    Google Scholar 

  6. S. Fiorini. On the chromatic index of a graph, III: Uniquely edge-colourable graphs, Quart. J. Math. (Oxford) (3) 26 (1975), 129–140.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. Fiorini, On the chromatic index of outerplanar graphs, J. Combinatorial Theory 18 (1975), 35–38.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Fiorini, Some remarks on a paper by Vizing on critical graphs, Math. Proc. Camb. Phil. Soc. 77 (1975), 475–483.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Fiorini and R. J. Wilson, On the chromatic index of a graph, II, in Combinatorics (Proceedings of the British Combinatorial Conference, Aberystwyth, 1973), London Math. Soc. Lecture Notes No. 13, pp. 37–51.

    Google Scholar 

  10. S. Fiorini and R. J. Wilson, Edge-colourings of graphs — some applications, Proceedings of the Fifth British Combinatorial Conference, Aberdeen, 1975, Utilitas Mathematica (Winnipeg), pp. 193–202.

    Google Scholar 

  11. D. Greenwell and H. Kronk, Uniquely line-colorable graphs, Canad. Math. Bull. 16 (1973), 525–529.

    Article  MathSciNet  MATH  Google Scholar 

  12. R. Isaacs, Infinite families of nontrivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975), 221–239.

    Article  MathSciNet  MATH  Google Scholar 

  13. I. T. Jakobsen, Some remarks on the chromatic index of a graph, Arch. Math. (Basel) 24 (1973), 440–448.

    Article  MathSciNet  MATH  Google Scholar 

  14. I. T. Jakobsen, On critical graphs with chromatic index 4, Discrete Math. 9 (1974), 265–276.

    Article  MathSciNet  MATH  Google Scholar 

  15. D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann. 77 (1916), 453–465.

    Article  MathSciNet  MATH  Google Scholar 

  16. G. H. J. Meredith, Regular n-valent, n-connected, non-Hamiltonian, non-n-edge-colourable graphs, J. Combinatorial Theory 14 (1973), 55–60.

    Article  MathSciNet  MATH  Google Scholar 

  17. G. H. J. Meredith and E. K. Lloyd, The footballers of Croam, J. Combinatorial Theory 15 (1973), 161–166.

    Article  MathSciNet  MATH  Google Scholar 

  18. C. E. Shannon, A theorem on colouring the lines of a network, J. Math. Phys. 28 (1949), 148–151.

    MathSciNet  MATH  Google Scholar 

  19. P. G. Tait, On the colouring of maps, Proc. Roy. Soc. Edinburgh 10 (1878–80), 501–503, 729.

    Google Scholar 

  20. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz 3 (1964), 25–30.

    MathSciNet  Google Scholar 

  21. V. G. Vizing, The chromatic class of a multigraph, Cybernetics 1 No. 3 (1965), 32–41.

    Article  MathSciNet  Google Scholar 

  22. V. G. Vizing, Critical graphs with a given chromatic class, Diskret. Analiz 5 (1965), 9–17.

    MathSciNet  MATH  Google Scholar 

  23. M. E. Watkins, A theorem on Tait colorings with an application to the generalized Petersen graphs, in Proof Techniques in Graph Theory (ed. F. Harary), Academic Press 1969, pp. 171–177.

    Google Scholar 

  24. R. J. Wilson, Some conjectures on edge-colourings of graphs, in Recent Advances in Graph Theory, Academia Prague 1975, pp. 525–528.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Open University, USA

    Robin J. Wilson

Authors
  1. Robin J. Wilson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wilson, R.J. (1978). Edge-colorings of graphs — A survey. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070415

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation