The crossing number of the generalized Petersen graph is four
Marko Lovrečič Saražin (1997)
Mathematica Slovaca
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.
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: