### Abstract

When can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that (Formula Presented.) for all X ⊆ E(G) ‐ E(K), where μ_{i}(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching. This condition is not sufficient in general, but is sufficient for graphs of very simple structure. We try to locate the border where sufficiency ends.

Original language | English (US) |
---|---|

Pages (from-to) | 565-573 |

Number of pages | 9 |

Journal | Journal of Graph Theory |

Volume | 14 |

Issue number | 5 |

DOIs | |

State | Published - Nov 1990 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Geometry and Topology

## Fingerprint Dive into the research topics of 'Extending an edge‐coloring'. Together they form a unique fingerprint.

## Cite this

Marcotte, O., & Seymour, P. D. (1990). Extending an edge‐coloring.

*Journal of Graph Theory*,*14*(5), 565-573. https://doi.org/10.1002/jgt.3190140508