Name
Abstract | ||
|---|---|---|
Let odd(G) denote the number of odd components of a graph G and k >= 2 be an integer. We give sufficient conditions using odd(G - S) for a graph G to have an even factor. Moreover, we show that if a graph G satisfies odd(G - S) <= max{1, (1/k)vertical bar S vertical bar} for all S subset of V(G), then G has a (k - 1)-regular factor for k >= 3 or an H-factor for k = 2, where we say that G has an H-factor if for every labeling h : V(G) -> {red, blue} with #{v is an element of V (G) : f(v) = red} even, G has a spanning subgraph F such that deg(F) (x) = 1 if h(x) = red and deg(F) (x) is an element of {0, 2} otherwise. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.7151/dmgt.2158 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | DocType | Volume |
factor of graph,even factor,regular factor,Tutte type condition | Journal | 40 |
Issue | ISSN | Citations |
4 | 1234-3099 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikio Kano | 1 | 548 | 99.79 |
| Zheng Yan | 2 | 0 | 2.37 |