Article
Licensed
Unlicensed
Requires Authentication
On the edge colouring of bipartite graphs
Published/Copyright:
April 2, 2009
Abstract
For the bipartite graphs G(X, Y, E) such that the degrees of vertices y ∈ Y do not exceed q and the degrees of vertices x ∈ 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 ∈ X and the colours of edges incident with a vertex y ∈ Y coincide.
Received: 2008-01-01
Published Online: 2009-04-02
Published in Print: 2009-March
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Analysis of behaviour of automata
- On reliability of circuits over the bases {~, &, ⊕}, {~, &, 0}, {⊕, &, 1}, {⊕, ∨, 1} in the case of faults of type 0 at the outputs of elements
- The diameter of the ridge-graph of a cyclic polytope
- On distribution of some classes of monotone k-valued functions on the lattice of closed classes
- On layers in the system of generators of the subdirect product of subgroups of a finite group
- On the edge colouring of bipartite graphs
- On the automorphisms of the strongly regular graph with parameters (85, 14, 3, 2)
Articles in the same Issue
- Analysis of behaviour of automata
- On reliability of circuits over the bases {~, &, ⊕}, {~, &, 0}, {⊕, &, 1}, {⊕, ∨, 1} in the case of faults of type 0 at the outputs of elements
- The diameter of the ridge-graph of a cyclic polytope
- On distribution of some classes of monotone k-valued functions on the lattice of closed classes
- On layers in the system of generators of the subdirect product of subgroups of a finite group
- On the edge colouring of bipartite graphs
- On the automorphisms of the strongly regular graph with parameters (85, 14, 3, 2)
