Open Access
Graph decomposition
Edward Allburn
- 01 Nov 1990
Vol. 16, Iss: 1, pp 88
87
About: The article was published on 01 Nov 1990. and is currently open access. The article focuses on the topics: Graph (abstract data type).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Perspectives: Graph factors and factorization: 1985-2003: A survey
TL;DR: The purpose here is to concentrate primarily on surveying the developments of the last 15-20 years in this exponentially growing field of graph decompositions.
162
•Posted Content
Università degli studi di roma "la sapienza"
Tesi Di Laurea,Specialistica +1 more
- 01 Jan 2000
TL;DR: In this paper, the authors review the main features of the new theory of public utilities regulation, theoretically assuming asymmetric information and give way to a strategic interaction between firm and regulator, and highlight the role of the constraints of participation and incentive compatibility faced by the regulator trying to improve efficiency.
A survey on the existence of G-Designs
TL;DR: A G-design of order n is a decomposition of the complete graph on n vertices into edge-disjoint subgraphs isomorphic to G as mentioned in this paper, which is the state of the art.
89
Combinatorial designs and the theorem of Weil on multiplicative character sums
Marco Buratti,Anita Pasotti +1 more
TL;DR: It is proved that there exists an elementary abelian @C-decomposition of the complete graph K"q for any prime power q=1 (mod 2e) with q>d^2e^2^d where d and e are the max-min degree and the number of edges of @C, respectively.
78
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
TL;DR: The bipartite graph having an edge-weighting with weights 1 , 2 such that neighboring vertices have distinct weighted degrees is characterized completely.
63
References
Perspectives: Graph factors and factorization: 1985-2003: A survey
TL;DR: The purpose here is to concentrate primarily on surveying the developments of the last 15-20 years in this exponentially growing field of graph decompositions.
162
•Posted Content
Università degli studi di roma "la sapienza"
Tesi Di Laurea,Specialistica +1 more
- 01 Jan 2000
TL;DR: In this paper, the authors review the main features of the new theory of public utilities regulation, theoretically assuming asymmetric information and give way to a strategic interaction between firm and regulator, and highlight the role of the constraints of participation and incentive compatibility faced by the regulator trying to improve efficiency.
A survey on the existence of G-Designs
TL;DR: A G-design of order n is a decomposition of the complete graph on n vertices into edge-disjoint subgraphs isomorphic to G as mentioned in this paper, which is the state of the art.
89
Combinatorial designs and the theorem of Weil on multiplicative character sums
Marco Buratti,Anita Pasotti +1 more
TL;DR: It is proved that there exists an elementary abelian @C-decomposition of the complete graph K"q for any prime power q=1 (mod 2e) with q>d^2e^2^d where d and e are the max-min degree and the number of edges of @C, respectively.
78
The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
TL;DR: The bipartite graph having an edge-weighting with weights 1 , 2 such that neighboring vertices have distinct weighted degrees is characterized completely.
63