Remarks on Fractional ID-k-factor-critical Graphs

Remarks on Fractional ID-k-factor-critical Graphs Let G be a graph, and k a positive integer. A graph G is fractional independent-set-deletable k-factor-critical (in short, fractional ID-k-factor-critical) if G - I has a fractional k-factor for every independent set I of G. In this paper, we present a sufficient condition for a graph to be fractional ID-k-factor-critical, depending on the minimum degree and the neighborhoods of independent sets. Furthermore, it is shown that this result in this paper is best possible in some sense. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Remarks on Fractional ID-k-factor-critical Graphs

, Volume 35 (2) – May 15, 2019
7 pages

/lp/springer-journals/remarks-on-fractional-id-k-factor-critical-graphs-WCmW4uN0Rw
Publisher
Springer Journals
Copyright © 2019 by The Editorial Office of AMAS & Springer-Verlag GmbH Germany
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-019-0818-6
Publisher site
See Article on Publisher Site

Abstract

Let G be a graph, and k a positive integer. A graph G is fractional independent-set-deletable k-factor-critical (in short, fractional ID-k-factor-critical) if G - I has a fractional k-factor for every independent set I of G. In this paper, we present a sufficient condition for a graph to be fractional ID-k-factor-critical, depending on the minimum degree and the neighborhoods of independent sets. Furthermore, it is shown that this result in this paper is best possible in some sense.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: May 15, 2019

References

Access the full text.