Academic Journal

The existence of even regular factors of regular graphs on the number of cut edges.

Bibliographic Details
Title: The existence of even regular factors of regular graphs on the number of cut edges.
Authors: Hong Bing Fan1 hfan@wlu.ca, Gui Zhen Liu2 gzliu@sdu.edu.cn, Ji Ping Liu3 liu@cs.uleth.ca, He Ping Long2 loheping@sdu.edu.cn
Superior Title: Acta Mathematica Sinica. Dec2010, Vol. 26 Issue 12, p2305-2312. 8p. 1 Diagram.
Subject Terms: *GRAPH theory, *ALGEBRAIC number theory, *FACTORS (Algebra), *ALGEBRA, *GRAPH algorithms
Abstract: For any even integer k and any integer i, we prove that a ( kr + i)-regular multigraph contains a k-factor if it contains no more than kr − $$ \frac{{3k}} {2} $$ + i + 2 cut edges, and this result is the best possible to guarantee the existence of k-factor in terms of the number of cut edges. We further give a characterization for k-factor free regular graphs. [ABSTRACT FROM AUTHOR]
Copyright of Acta Mathematica Sinica is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Academic Search Premier
Description
Description not available.