Embedding graphs in their complements

Ralph J. Faudree; Cecil C. Rousseau; Richard H. Schelp; Seymour Schuster

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Embedding graphs in their complements”

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:

Graph equations for line graphs and n-th distance graphs.

Simic, Slobodan K. (1983)

Publications de l'Institut Mathématique. Nouvelle Série

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.