Regular factors of line graphs

Tsuyoshi Nishimura

doi:10.1016/0012-365X(90)90023-B

Regular factors of line graphs

Tsuyoshi Nishimura

研究成果: Article › 査読

2 被引用数 (Scopus)

抄録

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.

本文言語	English
ページ（範囲）	215-219
ページ数	5
ジャーナル	Discrete Mathematics
巻	85
号	2
DOI	https://doi.org/10.1016/0012-365X(90)90023-B
出版ステータス	Published - 1990 11月 15
外部発表	はい

ASJC Scopus subject areas

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

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

他のファイルとリンク

引用スタイル

@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 = nov,

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

SN - 0012-365X

VL - 85

SP - 215

EP - 219

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2

ER -

Regular factors of line graphs

抄録

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル