Odd mean labeling of the graphs and
R. Vasuki, A. Nagarajan (2012)
Kragujevac Journal of Mathematics
Similarity:
Displaying similar documents to “The crossing number of the generalized Petersen graph is four”
Odd mean labeling of the graphs and
Characterization of a signed graph whose signed line graph is -consistent.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On -connected, planar -almost pancyclic graphs
Marián Trenkler (1989)
Mathematica Slovaca
Similarity:
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
More on the complexity of cover graphs
Jaroslav Nešetřil, Vojtěch Rödl (1995)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
Another characterisation of planar graphs.
Little, C.H.C., Sanjith, G. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: