## Subgraphs of Random k-Edge-Coloured k-Regular Graphs

- Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
- Combinatorics, Probability & Computing
- 2009

Highly Influenced

@article{Plummer1994ExtendingMI, title={Extending matchings in graphs: A survey}, author={Michael D. Plummer}, journal={Discrete Mathematics}, year={1994}, volume={127}, pages={277-292} }

- Published 1994 in Discrete Mathematics
DOI:10.1016/0012-365X(92)00485-A

Gallai and Edmonds independently obtained a canonical decomposition of graphs in terms of their maximum matchings. Unfortunately, one of the degenerate cases for their theory occurs when the graph in question has a perfect matching (also known as a l-factor). Kotzig, Lovasz and others subsequently developed a further decomposition of such graphs. Among the… CONTINUE READING

Citations per Year

Semantic Scholar estimates that this publication has **94** citations based on the available data.

See our **FAQ** for additional information.

### Presentations referencing similar topics