Lower bounds for the average genus of a CF-graph
From MaRDI portal
Publication:612933
zbMATH Open1204.05040MaRDI QIDQ612933FDOQ612933
Authors: Yichao Chen 
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/225530
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On the average genus of a graph
- Bounds for the average genus of the vertex-amalgamation of graphs
- scientific article; zbMATH DE number 1501715
- Remarks on the lower bounds for the average genus
- Lower bounds for the average genus
- Lower bounds on the maximum genus of a connected graph
- On the lower bounds for the maximum genus for simple graphs
- scientific article; zbMATH DE number 3843773
- Lower bounds of the maximum genus on graphs in terms of diameter and girth
- Lower bounds on the maximum genus of loopless multigraphs
Cited In (5)
- Embedding of circulant graphs and generalized Petersen graphs on projective plane
- New bounds for the average genus and average number of faces of a simple graph
- Remarks on the lower bounds for the average genus
- The average genus for bouquets of circles and dipoles
- Bounds for the average genus of the vertex-amalgamation of graphs
This page was built for publication: Lower bounds for the average genus of a CF-graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612933)
