Graph equations for line graphs and n-th distance graphs.
Simic, Slobodan K. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Simic, Slobodan K. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
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.
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity:
Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Seymour Schuster (1981)
Czechoslovak Mathematical Journal
Similarity:
Adamaszek, Anna, Adamaszek, Michał (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Snježana Majstorović, Antoaneta Klobučar, Ivan Gutman (2009)
Zbornik Radova
Similarity: