### Abstract

We show that if m ≥ 2 is an even integer and G is a graph such that d_{G}(v) ≥ m + 1 for all vertices v in G, then the line graph L(G) of G has a 2m-factor; and that if m is a nonnegative integer and G is a connected graph with |E(G)| even such that d_{G}(v) ≥ m + 2 for all vertices v in G, then the line graph L(G) has a (2m+1)-factor.

Original language | English |
---|---|

Pages (from-to) | 215-219 |

Number of pages | 5 |

Journal | Discrete Mathematics |

Volume | 85 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1990 Nov 15 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Regular factors of line graphs'. Together they form a unique fingerprint.

## Cite this

Nishimura, T. (1990). Regular factors of line graphs.

*Discrete Mathematics*,*85*(2), 215-219. https://doi.org/10.1016/0012-365X(90)90023-B