book chapterBirkhäuser Boston eBooksJan 1, 2009Closed access

Paths, Trees, and Flowers

JEJack Edmonds

Princeton University · National Institute of Standards and Technology

Indexed incrossref

Abstract

A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-points.

Citation impact

1,536
total citations
FWCI
92.86
Percentile
100%
References
10
Citations per year

Authors

1

Topics & keywords

Topics
Keywords
  • Enhanced Data Rates for GSM Evolution
  • Combinatorics
  • Join (topology)
  • Graph
  • Mathematics
  • Set (abstract data type)
  • Edge contraction
  • Computer science
No related works found for this paper.