AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also examine the structure of such extremal graphs
AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is show...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractWe begin the study of sets of near 1-factors of graphs G of odd order whose union contains a...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractA well known conjecture in graph theory states that every regular graph of even order 2n and...
AbstractEvery one-factorization of the complete graph on n vertices contains k one-factors whose uni...
AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is show...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractWe begin the study of sets of near 1-factors of graphs G of odd order whose union contains a...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
A 1-factor in an n-vertex graph G is a collection of n/2 vertex-disjoint edges and a 1-factorization...
AbstractRecently Alon and Friedland have shown that graphs which are the union of complete regular b...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractA well known conjecture in graph theory states that every regular graph of even order 2n and...
AbstractEvery one-factorization of the complete graph on n vertices contains k one-factors whose uni...
AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is show...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
DOI
Add to ORKG