Skip to main content
Book Chapter

The Average Size of Nonsingular Sets in a Graph

  • Imrich W
  • Sauer N
  • Woess W
Springer Netherlands, (1993), 199-205
DOI: 10.1007/978-94-011-2080-7_14
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Imrich, W., Sauer, N., & Woess, W. (1993). The Average Size of Nonsingular Sets in a Graph. In Finite and Infinite Combinatorics in Sets and Logic (pp. 199–205). Springer Netherlands. https://doi.org/10.1007/978-94-011-2080-7_14

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