AbstractAn edge-colouring algorithm that uses no colour interchanges is described that achieves Shannon's bound, χ′(G) ⩽ ⌊32Δ(G)⌋, for any loopless multigraph G. Also, a counterexample is presented to an edge-colouring conjecture from the matching theory text of Lovász and Plummer
AbstractLet g = (V, E, w) be a multigraph, where V is a set of vertices, E is a set of edges, and w ...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$...
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have dist...
AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n co...
AbstractAn assignment of colours to the edges of a multigraph is called an s-improper edge-colouring...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n...
AbstractWe introduce a monotone invariant π(G) on graphs and show that it is an upper bound of the c...
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have dist...
AbstractLet g = (V, E, w) be a multigraph, where V is a set of vertices, E is a set of edges, and w ...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$...
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have dist...
AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n co...
AbstractAn assignment of colours to the edges of a multigraph is called an s-improper edge-colouring...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
AbstractIn this note we summarize some of the progress made recently by the author, A.G. Chetwynd an...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by n c...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by $n...
AbstractWe introduce a monotone invariant π(G) on graphs and show that it is an upper bound of the c...
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have dist...
AbstractLet g = (V, E, w) be a multigraph, where V is a set of vertices, E is a set of edges, and w ...
Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-colored by $n$...
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have dist...
DOI
Add to ORKG