AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detailed. We prescribe certain inequalities for the valencies of a subgraph. We deduce formulas for the minimum “deviation” of this prescription and characterize the “optimally approaching” subgraphs. These results include the conditions of Tutte and Ore for the existence of a factor and the characterization of maximal independent edge-systems given in [3] and [11]
For a family of connected graphs ℱ, a spanning subgraph H of a graph G is called an ℱ-factor of G if...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
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...
Let G be a graph with vertex set V (G) and edge set E(G). The isolated toughness of G is defined as ...
For a family of connected graphs ℱ, a spanning subgraph H of a graph G is called an ℱ-factor of G if...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
AbstractIn this paper we prove the following: let G be a graph with eG edges, which is (k − 1)-edge-...
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These ...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
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...
Let G be a graph with vertex set V (G) and edge set E(G). The isolated toughness of G is defined as ...
For a family of connected graphs ℱ, a spanning subgraph H of a graph G is called an ℱ-factor of G if...
AbstractWe investigate the maximum number of edges in a graph with a prescribed number of 1-factors....
AbstractThe author has published a necessary and sufficient condition for a finite looplesses graph ...
DOI
Add to ORKG