Decompositions of Graphs into 5-Cycles and Other Small Graphs

@article{Sousa2005DecompositionsOG,
  title={Decompositions of Graphs into 5-Cycles and Other Small Graphs},
  author={Teresa Sousa},
  journal={Electr. J. Comb.},
  year={2005},
  volume={12}
}
In this paper we consider the problem of finding the smallest number q such that any graph G of order n admits a decomposition into edge disjoint copies of a fixed graph H and single edges with at most q elements. We solve the case when H is the 5-cycle, the 5-cycle with a chord and any connected non-bipartite non-complete graph of order 4. 

From This Paper

Figures and tables from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

On complete subgraphs of different orders

  • B. Bollobás
  • Math. Proc. Cambridge Philos. Soc., 79(1):19–24
  • 1976
Highly Influential
5 Excerpts

The representation of a graph by set intersections

  • P. Erdős, A. W. Goodman, L. Pósa
  • Canad. J. Math., 18:106–112
  • 1966
Highly Influential
5 Excerpts

On a problem of K

  • T. Kövari, V. T. Sós, P. Turán
  • Zarankiewicz. Colloquium Math., 3:50–57
  • 1954
Highly Influential
3 Excerpts

Modern Graph Theory

  • B. Bollobás
  • Springer–Verlag
  • 2002
1 Excerpt

Graph Theory

  • R. Diestel
  • Springer–Verlag, 2nd edition
  • 2000

On a problem of K . Zarankiewicz

  • V. T. Sós T. Kövari, P. Turán
  • Graph theory
  • 1972

Similar Papers

Loading similar papers…