Results 231 to 240 of about 2,800 (262)

Panchromatic photochromic push-pull dyes featuring a ferrocene donor group.

open access: yesMater Chem Front
Mirani D   +6 more
europepmc   +1 more source

Edge Colouring with Delays

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

Restricted Edge-colourings of Bipartite Graphs

Combinatorics, Probability and Computing, 1996
Suppose 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

Matching, Edge-Colouring, and Dimers

2003
We survey some recent results on finding and counting perfect matchings in regular bipartite graphs, with applications to bipartite edge-colouring and the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erdős and
openaire   +1 more source

An Edge-Colouring Problem

The American Mathematical Monthly, 1972
(1972). An Edge-Colouring Problem. The American Mathematical Monthly: Vol. 79, No. 9, pp. 1018-1020.
openaire   +1 more source

The neighbour sum distinguishing relaxed edge colouring

Applied Mathematics and Computation, 2022
Elżbieta Sidorowicz, Eric Duchêne
exaly  

A note on connected greedy edge colouring

Discrete Applied Mathematics, 2021
Marthe Bonamy   +2 more
exaly  

Home - About - Disclaimer - Privacy