On the complexity of the subgraph problem
Jaroslav Nešetřil, Svatopluk Poljak (1985)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Displaying similar documents to “On nonplanar graphs with the minimum number of vertices and a given girth”
On the complexity of the subgraph problem
Graphs with small asymmetries
Jaroslav Nešetřil (1970)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Isomorphisms of products of infinite connected graphs
Věra Trnková (1984)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Partitions of vertices
Jaroslav Nešetřil, Vojtěch Rödl (1976)
Commentationes Mathematicae Universitatis Carolinae
Similarity: