Binding number and path-factor critical deleted graphs
AbstractA graph G is called a [Formula: see text]-factor deleted graph if G – e has a [Formula: see text]-factor for any [Formula: see text] A graph G is [Formula: see text]-factor critical deleted if for every subset [Formula: see text] with [Formula: see text] the graph [Formula: see text] is [For...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2022-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2022.2094299 |