{
  "id": "1301.7565",
  "version": "v1",
  "published": "2013-01-31T09:53:25.000Z",
  "updated": "2013-01-31T09:53:25.000Z",
  "title": "A Note On Edge Connectivity and Parity Factor",
  "authors": [
    "Hongliang Lu"
  ],
  "comment": "5 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we investigate some parity factors by using Lov\\'asz's (g,f)-parity theorem. Let $m>0$ be an integer. Firstly, we obtain a sufficient and necessary condition for some graphs to have a parity factor with restricted minimum degree. Secondly, we obtain some sufficient conditions for a graph to have a parity factor with minimum degree $m$ in term of edge connectivity.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-01-31T09:53:25.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "parity factor",
      "edge connectivity",
      "sufficient conditions",
      "necessary condition",
      "restricted minimum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1301.7565L"
    }
  }
}