Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

For G=GSp_4 we construct an automorphic sheaf correspinding to a G^L-local system on a curve X such that its standard… Expand

2019

2019

Abstract The Kinoshita graph is a particular embedding in the 3-sphere of a graph with three edges, two vertices, and no loops… Expand

2019

2019

With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We… Expand

2018

2018

The theta graph $\Theta_{\ell,t}$ consists of two vertices joined by $t$ vertex-disjoint paths of length $\ell$ each. For fixed… Expand

2015

2015

In online list coloring [introduced by Zhu (Electron J Comb 16(1):#R127, 2009) and Schauz (Electron J Comb 16:#R77, 2009)], on… Expand

2012

2012

Yao and Theta graphs are defined for a given point set and a fixed integer k > 0. The space around each point is divided into k… Expand

2007

2007

Given a graph G, an edge-coloring of G with colors 1,2,3,... is consecutive if the colors of edges incident to each vertex are… Expand

2005

2005

We consider a reductive dual pair (G, G') in the stable range with G' the smaller member and of Hermitian symmetric type. We… Expand

2001

2001

We discuss various constructions which allow one to embed a principally polarized abelian variety in the jacobian of a curve… Expand

2001

2001

The generalized theta graph ?s1, ?, sk consists of a pair of endvertices joined by k internally disjoint paths of lengths s1… Expand