The following pages link to Jonathan L. Gross (Q276786):
Displaying 50 items.
- Root geometry of polynomial sequences. II: Type \((1,0)\). (Q276789) (← links)
- Log-concavity of genus distributions of ring-like families of graphs (Q404443) (← links)
- Genus distributions for iterated claws (Q405081) (← links)
- Genus distribution of \(P_3 \mathop\square P_n\) (Q449126) (← links)
- Genus distributions of star-ladders (Q456899) (← links)
- Log-concavity of the genus polynomials for a sequence of cubic Halin graphs (Q477974) (← links)
- Root geometry of polynomial sequences. I: Type \((0, 1)\) (Q499206) (← links)
- A celtic framework for knots and links (Q542383) (← links)
- Genus distributions of 4-regular outerplanar graphs (Q648404) (← links)
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration (Q825536) (← links)
- Combinatorial conjectures that imply local log-concavity of graph genus polynomials (Q896075) (← links)
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs (Q921011) (← links)
- Genus distribution of graphs under surgery: adding edges and splitting vertices (Q983423) (← links)
- Genus distributions for two classes of graphs (Q1118607) (← links)
- Limit points for average genus. II: 2-connected non-simplicial graphs (Q1204469) (← links)
- Kuratowski-type theorems for average genus (Q1204482) (← links)
- The topological theory of current graphs (Q1214425) (← links)
- Components of branched coverings of current graphs (Q1214426) (← links)
- Quotients of complete graphs: revisiting the Heawood map-coloring problem (Q1217555) (← links)
- The genus of nearly complete graphs-case 6 (Q1231498) (← links)
- Every connected regular graph of even degree is a Schreier coset graph (Q1243737) (← links)
- Generating all graph coverings by permutation voltage assignments (Q1246168) (← links)
- Genus distributions for bouquets of circles (Q1263599) (← links)
- Overlap matrices and total imbedding distributions (Q1322173) (← links)
- On the genus distributions of wheels and of related graphs (Q1699533) (← links)
- Voltage graphs (Q1845889) (← links)
- Stratified graphs for imbedding systems (Q1897429) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Partial duality for ribbon graphs. I: distributions (Q1987078) (← links)
- Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations (Q2033937) (← links)
- Genus polynomials of ladder-like sequences of graphs (Q2196486) (← links)
- Extended graph rotation systems as a model for cyclic weaving on orientable surfaces (Q2355747) (← links)
- On the average genus of a graph (Q2366954) (← links)
- Enumeration of digraph embeddings (Q2441661) (← links)
- Topological graph theory. (Q2732568) (← links)
- Iterated claws have real-rooted genus polynomials (Q2827778) (← links)
- Total embedding distributions of circular ladders (Q2852610) (← links)
- Genus distributions of graphs under self-edge-amalgamations (Q2892014) (← links)
- Embeddings of cubic Halin graphs: genus distributions (Q2925424) (← links)
- Genus distributions of cubic series-parallel graphs (Q2928586) (← links)
- Embeddings of graphs of fixed treewidth and bounded degree (Q2940093) (← links)
- Genus distributions of iterated 3-wheels and 3-prisms (Q2940095) (← links)
- A Linear Time Planarity Algorithm for 2-Complexes (Q3048280) (← links)
- Genus distribution of graph amalgamations: Pasting when one root has arbitrary degree (Q3085020) (← links)
- (Q3090462) (← links)
- (Q3094521) (← links)
- (Q3341861) (← links)
- Local extrema in genus-stratified graphs (Q3353034) (← links)
- Log-concavity of genus distributions for circular ladders (Q3463406) (← links)
