Embedding graphs in their complements
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Seymour Schuster (1981)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Graph equations for line graphs and n-th distance graphs.”
Embedding graphs in their complements
On graphs with prescribed edge neighbourhoods
Dalibor Fronček (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Characterization of semientire graphs with crossing number 2
D. G. Akka, J. K. Bano (2002)
Mathematica Bohemica
Similarity:
The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.
Characterization of -minimally nonouterplanar join graphs
D. G. Akka, J. K. Bano (2001)
Mathematica Bohemica
Similarity:
In this paper, we present characterizations of pairs of graphs whose join graphs are 2-minimally nonouterplanar. In addition, we present a characterization of pairs of graphs whose join graphs are 2-minimally nonouterplanar in terms of forbidden subgraphs.
On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.
Chia, Gek Ling, Ho, Chee-Kit (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity: