Graphs having planar complementary line (total) graphs.
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “The edge-count criterion for graphic lists.”
Graphs having planar complementary line (total) graphs.
On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Edge rotations and distance between graphs
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Extremely Irregular Graphs
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Magic and supermagic dense bipartite graphs
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.