◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yuanrui Feng

3 papers hereh-index 14 citations5 works total

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

author position
  • first author2
  • middle author1

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

fields
  • math.CO3

identity via Semantic Scholar / OpenAlex

activity
20192024
most citedUpper bounds for bar visibility of subgraphs and n-vertex graphs

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

collaborators

3 papers

math.CO2024

On isomorphisms of m-Cayley digraphs

Xing Zhang, Yuan-Quan Feng, Fu-Gang Yin +1

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t…

math.CO2021

Some new results on bar visibility of digraphs

Yuanrui Feng, Jun Ge, Douglas B. West +1

Visibility representation of digraphs was introduced by Axenovich, Beveridge, Hutch\-inson, and West (\emph{SIAM J. Discrete Math.} {\bf 27}(3) (2013) 1429--1449) as a natural gene…

math.CO2019★ 1 cited

Upper bounds for bar visibility of subgraphs and n-vertex graphs

Yuanrui Feng, Douglas B. West, Yan Yang

A t-bar visibility representation of a graph assigns each vertex up to t horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…

◍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.