ON DECOMPOSITION OF GRAPHS By

@inproceedings{ERDS1960ONDO,
  title={ON DECOMPOSITION OF GRAPHS By},
  author={Y. ERD{\'O}S and Andr{\'a}s Hajnal},
  year={1960}
}
We are going to use the notations introduced in our paper [1]*, § 2. A graph ~e is an ordered pair (g, G) where the elements of the sets g and G are the vertices and the edges of n respectively. We assume that the reader is familiar to the usual terminilogy of graph-theory. The aim of this paper is to consider two kinds of decompositions of graphs called vertexand edge-decompositions respectively . 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

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

ROGERS , The construction of certain graphs , Canadian Math

  • A.

Similar Papers

Loading similar papers…