Name
Abstract | ||
|---|---|---|
An odd factor of a graph is a spanning subgraph in which every vertex has odd degree. Catlin [J. Graph Theory 12 (1988), 29-44] proved that every 4-edge-connected graph of even order has a connected odd factor. In this paper, we consider graphs of odd order, and show that for every 4-edge-connected graph G of odd order, there exists a vertex w such that G - w has a connected odd factor. Moreover, we show that the condition on 4-edge-connectedness in the above theorem is best possible. |
Year | Venue | DocType |
|---|---|---|
2019 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
73 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nastaran Haghparast | 1 | 0 | 0.34 |
| Mikio Kano | 2 | 548 | 99.79 |
| Shunichi Maezawa | 3 | 0 | 0.34 |
| Kenta Ozekit | 4 | 0 | 0.34 |