Displaying similar documents to “Odd mean labeling of the graphs P a , b , P a b and P 2 a b

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.