Graph Theory: Favorite Conjectures And Open Problems

  • Gera R
  • Hedetniemi S
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Discovery -- Graphs -- Blocks -- Trees -- Connectivity -- Partitions -- Traversability -- Line graphs -- Factorization -- Coverings -- Planarity -- Colorability -- Matrices -- Groups -- Enumeration -- Digraphs.

Cite

CITATION STYLE

APA

Gera, R., & Hedetniemi, S. (2016). Graph Theory: Favorite Conjectures And Open Problems. (R. Gera, S. Hedetniemi, & C. Larson, Eds.), Medium - University of Liverpool (p. 274). Springer International Publishing. Retrieved from http://link.springer.com/10.1007/978-3-319-31940-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free