pith. machine review for the scientific record. sign in

arxiv: 1007.4263 · v1 · submitted 2010-07-24 · 🧮 math.CO

Recognition: unknown

Vertex-deleted subgraphs and regular factors from regular graph

Authors on Pith no claims yet
classification 🧮 math.CO
keywords regulargraphconditionscontainsedge-connectedfactorfactorsguarantee
0
0 comments X
read the original abstract

Let $k$, $m$ and $r$ be three integers such that $2\leq k\leq m\leq r$. Let $G$ be a $2r$-regular, $2m$-edge-connected graph of odd order. We obtain some sufficient conditions, which guarantee $G-v$ contains a $k$-factor for all $v\in V(G)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.