◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Emma E. Snively

2 papers hereh-index 235 citations4 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • math.CO2

identity via Semantic Scholar / OpenAlex

most citedOn Universal Cycles of Labeled Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2008

Contributions to Seymour's Second Neighborhood Conjecture

James N. Brantner, Greg Brockman, Bill Kay +1

Let D be a simple digraph without loops or digons. For any v in V(D) let N_1(v) be the set of all nodes at out-distance 1 from v and let N_2(v) be the set of all nodes at out-dista…

math.CO2008★ 1 cited

On Universal Cycles of Labeled Graphs

Greg Brockman, Bill Kay, Emma E. Snively

A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.