DOIAbstract
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper bounds for their number of edges. The second part deals with the maximum number of edges in graphs having a unique [1,k]-factor
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper bounds for their number of edges. The second part deals with the maximum number of edges in graphs having a unique [1,k]-factor
Let G be a simple graph and f: V (G) 7 → {1, 3, 5,...} an odd integer valued function defined on V (...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
AbstractWe show that anyk-regular bipartite graph with 2nvertices has at least(k−1)k-1kk-2nperfect m...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
Let G be a simple graph and f: V (G) 7 → {1, 3, 5,...} an odd integer valued function defined on V (...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
AbstractLet f(k) be the largest number such that each k-regular bipartite graph with 2n vertices has...
AbstractWe show that anyk-regular bipartite graph with 2nvertices has at least(k−1)k-1kk-2nperfect m...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
This paper gives a new and faster algorithm to find a 1-factor in a bipartite ∆-regular graph. The ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
Let G be a simple graph and f: V (G) 7 → {1, 3, 5,...} an odd integer valued function defined on V (...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
Add to ORKG