Home > Research > Publications & Outputs > Star multigraphs with three vertices of maximum...

Electronic data


Text available via DOI:

View graph of relations

Star multigraphs with three vertices of maximum degree.

Research output: Contribution to journalJournal articlepeer-review

<mark>Journal publication date</mark>09/1986
<mark>Journal</mark>Mathematical Proceedings of the Cambridge Philosophical Society
Issue number2
Number of pages15
Pages (from-to)303-317
Publication StatusPublished
<mark>Original language</mark>English


The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops. In particular we shall consider a special kind of multigraph, called a star-multigraph: this is a multigraph which contains a vertex v*, called the star-centre, which is incident with each non-simple edge. An edge-colouring of a multigraph G is a map ø: E(G)→, where is a set of colours and E(G) is the set of edges of G, such that no two edges receiving the same colour have a vertex in common. The chromatic index, or edge-chromatic numberχ′(G) of G is the least value of || for which an edge-colouring of G exists. Generalizing a well-known theorem of Vizing [14], we showed in [6] that, for a star-multigraph G, where Δ(G) denotes the maximum degree (that is, the maximum number of edges incident with a vertex) of G. Star-multigraphs for which χ′(G) = Δ(G) are said to be Class 1, and otherwise they are Class 2.

Bibliographic note

http://journals.cambridge.org/action/displayJournal?jid=PSP The final, definitive version of this article has been published in the Journal, Mathematical Proceedings of the Cambridge Philosophical Society, 100 (2), pp 303-317 1986, © 1986 Cambridge University Press.