Graph equations for line graphs and n-th distance graphs.
Simic, Slobodan K. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Characterization of -minimally nonouterplanar join graphs”
Graph equations for line graphs and n-th distance graphs.
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.
Randomly graphs
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity: