AbstractClaude Berge has given sufficient conditions under which each edge of a regular multigraph belongs to some 1-factor. His proof-technique actually yields the same conclusion under less restrictive conditions. Here we point out that this stronger version of Berge's theorem follows easily from a theorem on doubly-stochastic matrices proved previously by the author
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractIn this paper we solve a uniform length cycle version of the Oberwolfach problem for multigr...
AbstractClaude Berge has given sufficient conditions under which each edge of a regular multigraph b...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractThe lower bounds on the cardinality of the maximum matchings of regular multigraphs are esta...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
We give a simple, self-contained proof of the following basic fact in matching theory: Every bi...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractIn this paper we solve a uniform length cycle version of the Oberwolfach problem for multigr...
AbstractClaude Berge has given sufficient conditions under which each edge of a regular multigraph b...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractWe present sufficient conditions for a regular multipartite graph to have a regular factor a...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
AbstractThe lower bounds on the cardinality of the maximum matchings of regular multigraphs are esta...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
We give a simple, self-contained proof of the following basic fact in matching theory: Every bi...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractIn this paper we solve a uniform length cycle version of the Oberwolfach problem for multigr...
DOI
Add to ORKG