Regular factors of line graphs

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We show that if m ≥ 2 is an even integer and G is a graph such that dG(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 dG(v) ≥ m + 2 for all vertices v in G, then the line graph L(G) has a (2m+1)-factor.

Original languageEnglish
Pages (from-to)215-219
Number of pages5
JournalDiscrete Mathematics
Volume85
Issue number2
DOIs
Publication statusPublished - 1990 Nov 15
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Regular factors of line graphs. / Nishimura, Tsuyoshi.

In: Discrete Mathematics, Vol. 85, No. 2, 15.11.1990, p. 215-219.

Research output: Contribution to journalArticle

Nishimura, Tsuyoshi. / Regular factors of line graphs. In: Discrete Mathematics. 1990 ; Vol. 85, No. 2. pp. 215-219.
@article{b0241611e4f54694900d4071379f2ec6,
title = "Regular factors of line graphs",
abstract = "We show that if m ≥ 2 is an even integer and G is a graph such that dG(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 dG(v) ≥ m + 2 for all vertices v in G, then the line graph L(G) has a (2m+1)-factor.",
author = "Tsuyoshi Nishimura",
year = "1990",
month = "11",
day = "15",
doi = "10.1016/0012-365X(90)90023-B",
language = "English",
volume = "85",
pages = "215--219",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Regular factors of line graphs

AU - Nishimura, Tsuyoshi

PY - 1990/11/15

Y1 - 1990/11/15

N2 - We show that if m ≥ 2 is an even integer and G is a graph such that dG(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 dG(v) ≥ m + 2 for all vertices v in G, then the line graph L(G) has a (2m+1)-factor.

AB - We show that if m ≥ 2 is an even integer and G is a graph such that dG(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 dG(v) ≥ m + 2 for all vertices v in G, then the line graph L(G) has a (2m+1)-factor.

UR - http://www.scopus.com/inward/record.url?scp=38249017160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249017160&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(90)90023-B

DO - 10.1016/0012-365X(90)90023-B

M3 - Article

AN - SCOPUS:38249017160

VL - 85

SP - 215

EP - 219

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -