|
This article is cited in 4 scientific papers (total in 4 papers)
On the edge colouring of bipartite graphs
A. M. Magomedov
Abstract:
For the bipartite graphs $G(X,Y,E)$ such that the degrees of vertices $y\in Y$ do not exceed $q$ and the degrees of vertices $x\in X$ are equal to $2q$, we consider the problem of existence of the edge 2-colouring such that $q$ edges of each colour are incident with each vertex $x\in X$ and the colours of edges incident with a vertex $y\in Y$ coincide.
Received: 22.01.2008
Citation:
A. M. Magomedov, “On the edge colouring of bipartite graphs”, Diskr. Mat., 21:2 (2009), 153–158; Discrete Math. Appl., 19:1 (2009), 81–87
Linking options:
https://www.mathnet.ru/eng/dm1055https://doi.org/10.4213/dm1055 https://www.mathnet.ru/eng/dm/v21/i2/p153
|
Statistics & downloads: |
Abstract page: | 663 | Full-text PDF : | 288 | References: | 71 | First page: | 23 |
|