On existence of [a,b]-factors avoiding given subgraphs
| dc.creator | Ma, Yinghong | |
| dc.creator | Yu, Qinglin | |
| dc.date | 2006-11-03 | |
| dc.date.accessioned | 2026-07-07T07:32:29Z | |
| dc.date.available | 2026-07-07T07:32:29Z | |
| dc.description | For a graph $G = (V(G), E(G))$, let $i(G)$ be the number of isolated vertices in $G$. The {\it isolated toughness} of $G$ is defined as $I(G) = min\{|S|/i(G-S) : S\subseteq V(G), i(G-S)\geq 2\}$ if $G$ is not complete; $I(G)=|V(G)|-1$ otherwise. In this paper, several sufficient conditions in terms of isolated toughness are obtained for the existence of $[a, b]$-factors avoiding given subgraphs, e.g., a set of vertices, a set of edges and a matching, respectively. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/math/0611070 | |
| dc.identifier | http://arxiv.org/abs/math/0611070 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119127 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C70 | |
| dc.title | On existence of [a,b]-factors avoiding given subgraphs | |
| dc.type | text |