AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽m⩽r. Then for every uϵV(G), the graph G−{u} has an m-factor
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractLet k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connecte...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractFor an undirected graph G, a variation of toughness is defined asτ(G)≔min|S|w(G−S)−1w(G−S)⩾2...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
AbstractGiven integers n, r and λ, we determine all values of k for which every simple r-regular gra...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractLet k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connecte...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractFor an undirected graph G, a variation of toughness is defined asτ(G)≔min|S|w(G−S)−1w(G−S)⩾2...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
AbstractGiven integers n, r and λ, we determine all values of k for which every simple r-regular gra...
AbstractLet G be a k-regular graph of order 2n such that k≥n. Hilton (J. Graph Theory, 9 (1985), 193...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
DOI
Add to ORKG