Abstract
In the previous chapters, we have been considering vertex colourings. Now we will consider edge colourings of a graph. We will say that two edges are incident if they have a common vertex. We would like to properly colour the edges, in the sense that no two incident edges receive the same colour.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Graham, H.O. Pollak, On the addressing problem for loop switching. Bell Syst. Tech. J. 50, 2495–2519 (1971)
R. Graham, H.O. Pollak, On embedding graphs in squashed cubes, in Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303 (Springer, Berlin, 1972), pp. 99–110
S. Radziszowski, Small Ramsey numbers. Electron. J. Comb. 1 (1994), Dynamic survey 1, 30 pp
H. Tverberg, On the decomposition of \(K_n\) into complete bipartite graphs. J. Graph Theory 6, 493–494 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 Hindustan Book Agency
About this chapter
Cite this chapter
Cioabă, S.M., Murty, M.R. (2022). Edges and Cycles. In: A First Course in Graph Theory and Combinatorics. Texts and Readings in Mathematics, vol 55. Springer, Singapore. https://doi.org/10.1007/978-981-19-0957-3_11
Download citation
DOI: https://doi.org/10.1007/978-981-19-0957-3_11
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-1335-8
Online ISBN: 978-981-19-0957-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)