Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Signed -matchings in graphs.”
Decompositions of graphs into 5-cycles and other small graphs.
A note on the vertex-switching reconstruction.
Krasikov, I. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Turàn number of the graph 3P4
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On equality of edge-connectivity and minimum degree of a graph
Ján Plesník, Štefan Znám (1989)
Archivum Mathematicum
Similarity:
On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.