The crossing number of the generalized Petersen graph is four
Marko Lovrečič Saražin (1997)
Mathematica Slovaca
Similarity:
Marko Lovrečič Saražin (1997)
Mathematica Slovaca
Similarity:
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.
Barát, János, Matoušek, Jirí, Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vladimír Puš (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Villarreal, Rafael H. (2007)
Revista Colombiana de Matemáticas
Similarity:
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated. ...