Homomorphisms of complete n-partite graphs.
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
Aneta Dudek, A. Paweł Wojda (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Don R. Lick (1976)
Colloquium Mathematicae
Similarity: