论文信息 - On a Max-min Problem Concerning Weights of Edges

On a Max-min Problem Concerning Weights of Edges

The weight w(e) of an edge e = uv of a graph is defined to be the sum of degrees of the vertices u and v. In 1990 P. Erdős asked the question: What is the minimum weight of an edge of a graph G having n vertices and m edges? This paper brings a precise answer to the above question of Erdős.

Stanislav Jendrol' | Ingo Schiermeyer

[1] Oleg V. Borodin. Computing Light Edges in Planar Graphs , 1990 .

[2] B. Grünbaum. Acyclic colorings of planar graphs , 1973 .

[3] Stanislav Jendrol',et al. Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs , 1997, Graphs Comb..

[4] E. Jucovič,et al. Strengthening of a theorem about 3-polytopes , 1974 .