An extremal problem for H -linked graphs

By Alexandr V. Kostochka, Gexin Yu. 2005

46 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/63a88568a262d2466d3dfd717d5f7fd4e8a4f78f

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. Jeannette C. M. Janssen
3. Anthony Bonato
4. Changping Wang

Citations in the corpus

• On H-immersions (2008, unknown): “In particular, we extend results found in [2], [3] and [5].”
• The n-ordered graphs: A new graph class (2009, background): “For proofs of some other special cases, see [3].”
• A Dynamic Survey of Graph Labeling (2009, background): “Hefetz [744] calls a graph with q edges k-antimagic if its edges can be labeled with 1, 2, .”
• Coloring plane graphs with independent crossings (2010, unknown): “Hefetz [6] proved that”