Stability number and f-factors in graphs
Kouider Mekkia
TL;DR
This paper introduces a new sufficient condition involving the stability number and toughness of a graph to guarantee the existence of an f-factor, advancing understanding of graph factorization properties.
Contribution
It provides a novel sufficient condition linking stability number and toughness to the existence of an f-factor in graphs.
Findings
New sufficient condition for f-factor existence
Relation between stability number and toughness
Enhanced criteria for graph factorization
Abstract
We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Graph Labeling and Dimension Problems