Component factors and binding number conditions in graphs
Let $ G $ be a graph. For a set $ \mathcal{H} $ of connected graphs, an $ \mathcal{H} $-factor of a graph $ G $ is a spanning subgraph $ H $ of $ G $ such that every component of $ H $ is isomorphic to a member of $ \mathcal{H} $. A graph $ G $ is called an $ (\mathcal{H}, m) $-factor deleted graph...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2021-08-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://aimspress.com/article/doi/10.3934/math.2021719?viewType=HTML |