An ore-type condition for the existence ofk-factors in graphs-Reference-Cited by-同舟云学术

An ore-type condition for the existence ofk-factors in graphs

Published:1991-12 Issue:4 Volume:7 Page:353-361
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Iida Tadashi,Nishimura Tsuyoshi

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01787640.pdf

Reference9 articles.

1. Chartrand G., Lesniak L.: Graphs & Digraphs, Wadsworth, Monterey, California, (1986)

2. Egawa Y., Enomoto H.: Sufficient conditions for the existence ofk-factors, Recent Studies in Graph Theory, Ed.: V. Kulli, Vishwa, Gulbarga (1989) 96–105

3. Iida T.: A neighborhood condition for the existence ofk-factors, Master Thesis, Dept. of Math., Tokai Univ. (1990)

4. Kano M. and Tokushige N.: Binding numbers andf-factors of graphs. J. Comb. Theory B. (to appear)

5. Katerinis P.: Minimum degree of a graph and the existence ofk-factors, Proc. Indian Acad. Sci (Math. Sci.)94, 123–127 (1985)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SHARP CONDITIONS FOR THE EXISTENCE OF AN EVEN [a, b]-FACTOR IN A GRAPH;B KOREAN MATH SOC;2021

2. Degree sum condition for fractional ID-$k$-factor-critical graphs;Miskolc Mathematical Notes;2017

3. Approximation and Exact Algorithms for Special Cases of Connected f-Factors;Lecture Notes in Computer Science;2015

4. Factors and Factorization;Discrete Mathematics and Its Applications;2013-11-26

5. DEGREE CONDITIONS AND FRACTIONAL k-FACTORS OF GRAPHS;Bulletin of the Korean Mathematical Society;2011-03-31