Pages that link to "Item:Q3939829"
From MaRDI portal
The following pages link to A new characterization of the maximum genus of a graph (Q3939829):
Displaying 14 items.
- Up-embeddability of graphs with new degree-sum (Q523775) (← links)
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679) (← links)
- The maximum and minimum genus of a multibranched surface (Q820638) (← links)
- Up-embeddability of graphs with small order (Q847307) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← links)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- A note on the maximum genus of 3-edge-connected nonsimple graphs (Q1589799) (← links)
- Lower bounds on the maximum genus of loopless multigraphs (Q1595253) (← links)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
