Find link

language:

Find link is a tool written by Edward Betts.

searching for Graph labeling 9 found (22 total)

Magic graph (408 words) [view diff] exact match in snippet view article find links to article

978-0-8176-8391-7 Joseph A. Gallian (1998), A dynamic survey of graph labeling. Electronic Journal of Combinatorics, vol. 5, Dynamic Survey 6. Updated

Book (graph theory) (735 words) [view diff] exact match in snippet view article

Graph". MathWorld. Gallian, Joseph A. (1998). "A dynamic survey of graph labeling". Electronic Journal of Combinatorics. 5: Dynamic Survey 6. MR 1668059

Windmill graph (525 words) [view diff] exact match in snippet view article find links to article

≡ 1 (mod 4). Gallian, J. A. (3 January 2007). "A dynamic survey of graph labeling" (PDF). Electronic Journal of Combinatorics. DS6: 1–58. MR 1668059.

Friendship graph (727 words) [view diff] exact match in snippet view article find links to article

MathWorld Gallian, Joseph A. (January 3, 2007), "A dynamic survey of graph labeling", Electronic Journal of Combinatorics: DS6, doi:10.37236/27. Erdős,

Permutohedron (1,332 words) [view diff] exact match in snippet view article find links to article

See, e.g., Ziegler (1995), p. 18. Ziegler (1995), p. 200. This Cayley graph labeling is shown, e.g., by Ziegler (1995). Baek, Adams & Dolson (2013). Baek

NP-intermediate (1,326 words) [view diff] exact match in snippet view article find links to article

1007/3-540-45687-2_4. Gallian, Joseph A. (December 17, 2021). "A dynamic survey of graph labeling". Electronic Journal of Combinatorics. 5: Dynamic Survey 6. MR 1668059

Joseph Gallian (673 words) [view diff] case mismatch in snippet view article find links to article

America. ISBN 978-0-88385-349-8. Gallian, Joseph A. "A Dynamic Survey of Graph Labeling". The Electronic Journal of Combinatorics. doi:10.37236/27. "Biography

List of graphs (1,221 words) [view diff] case mismatch in snippet view article find links to article

Discrete Math, Springer, 1993, p 436. Gallian, J. A. "Dynamic Survey DS6: Graph Labeling." Electronic Journal of Combinatorics, DS6, 1-58, January 3, 2007. [1]

Connected-component labeling (3,192 words) [view diff] no match in snippet view article find links to article

the edges indicate connected 'neighbors'. An algorithm traverses the graph, labeling the vertices based on the connectivity and relative values of their