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.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Non-repetitive 3-coloring of subdivided graphs.”

On Maximum Weight of a Bipartite Graph of Given Order and Size

Mirko Horňák, Stanislav Jendrol’, Ingo Schiermeyer (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erd˝os was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bipartite. It is shown that there is a function w*(n,m) such that the optimum weight is either...

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.