AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m be an integer such that1⩽m⩽k − 1. Then the graph obtained by removing any k − m edges of G, has an m-factor
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractLet k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connecte...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
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 graph to have an f-factor or a (g, f)-factor that con...
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...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractLet k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connecte...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
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 graph to have an f-factor or a (g, f)-factor that con...
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...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractLet G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1⩽...
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular gra...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
DOI
Add to ORKG