Add to ORKGAn excessive factorization of a graph G is a minimum set F of1-factors of G whose union is E(G). In this paper we study excessive factorizations of regular graphs. We introduce two graph parameters related to excessive factorizations and show that their computation is NP-hard. We pose a number of questions regarding these parameters. We show that the size of an excessive factorization of a regular graph can exceed the degree of the graph by an arbitrarily large quantity. We conclude with a conjecture on the excessive factorizations of r-graphs
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving ...
AbstractWe begin the study of sets of near 1-factors of graphs G of odd order whose union contains a...
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
An excessive factorization of a graph G is a minimum set F of1-factors of G whose union is E(G). In ...
AbstractAn excessive factorization of a multigraph G is a set F={F1,F2,…,Fr} of 1-factors of G whose...
An excessive factorization of a multigraph G is a set F = {F(1), F(2), ... F(r)) of 1-factors of G w...
Let B be a positive integer and let G be a simple graph. An excessive [B]-factorization of G is a mi...
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each...
AbstractWe show that there exists a family of r-regular graphs of arbitrarily large excessive index ...
Given two positive integers l and m, with l≤m, an [l,m]-covering of a graph G is a set M of matching...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the unio...
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...
abstract. The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k,...
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving ...
AbstractWe begin the study of sets of near 1-factors of graphs G of odd order whose union contains a...
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...
An excessive factorization of a graph G is a minimum set F of1-factors of G whose union is E(G). In ...
AbstractAn excessive factorization of a multigraph G is a set F={F1,F2,…,Fr} of 1-factors of G whose...
An excessive factorization of a multigraph G is a set F = {F(1), F(2), ... F(r)) of 1-factors of G w...
Let B be a positive integer and let G be a simple graph. An excessive [B]-factorization of G is a mi...
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each...
AbstractWe show that there exists a family of r-regular graphs of arbitrarily large excessive index ...
Given two positive integers l and m, with l≤m, an [l,m]-covering of a graph G is a set M of matching...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
We showed eariler that a regular simple graph of even order satisfying d(G) » 6/7|V(G)| was the unio...
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...
abstract. The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k,...
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving ...
AbstractWe begin the study of sets of near 1-factors of graphs G of odd order whose union contains a...
We investigate the maximum number of edges in a graph with a prescribed number of 1-factors. We also...