Results 131 to 140 of about 2,634 (144)
Some of the next articles are maybe not open access.
Fast parallel edge colouring of graphs
Journal of Parallel and Distributed Computing, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sajith, G., Saxena, S.
openaire +1 more source
Combinatorics, Probability and Computing, 2004
Consider the following communication problem, which leads to a new notion of edge colouring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers.
Noga Alon, Vera Asodi
openaire +1 more source
Consider the following communication problem, which leads to a new notion of edge colouring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers.
Noga Alon, Vera Asodi
openaire +1 more source
Restricted Edge-colourings of Bipartite Graphs
Combinatorics, Probability and Computing, 1996Suppose each vertex of a bipartite multigraph (with partition (X, Y)) is assigned a set of colours; we say this colour scheme is feasible if the edges of the graph can be properly coloured so that each receives a colour in both of its endpoints' sets. We prove various results showing that certain types of colour scheme are always feasible. For instance,
openaire +2 more sources
Minimal Edge-Colourings of Complete Graphs
Journal of the London Mathematical Society, 1975openaire +1 more source