PEARLS in GRAPH THEORY

By N. Hartsfield, G. Ringel. 2007

327 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/04eb71ccc65edf1c2b2f3b43bdb89a8e90fe8a8b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Joseph A. Gallian
2. Ladislav Stacho
3. Daniel Král

Citations in the corpus

• A Dynamic Survey of Graph Labeling (2009, methodology): “The Ringel-Kotzig conjecture (GTC) that all trees are graceful has been the focus of many papers.”
• Coloring plane graphs with independent crossings (2010, background): “In [ 5 ], Ringel has conjectured that every simple connected graph, other than K2, is antimagic.”