Pages that link to "Item:Q2276970"
From MaRDI portal
The following pages link to The maximum genus of graphs of diameter two (Q2276970):
Displaying 14 items.
- Minimum genus embeddings of the complete graph (Q335320) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Up-embeddability via girth and the degree-sum of adjacent vertices (Q1042914) (← links)
- Upper embeddability of graphs (Q1128130) (← links)
- The maximum genus of graphs with diameter three (Q1297478) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← links)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)
- (Q4022063) (← links)
- (Q4886767) (← links)
- (Q5708581) (← links)
- (Q5708582) (← links)
