Pages that link to "Item:Q1923508"
From MaRDI portal
The following pages link to A tight lower bound on the maximum genus of a simplicial graph (Q1923508):
Displaying 16 items.
- Remarks on the lower bounds for the average genus (Q475705) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- The maximum genus of graphs with diameter three (Q1297478) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Algorithmic graph embeddings (Q1391310) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← 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)
- A tight lower bound on the maximum genus of a 3-connected loopless multigraph (Q1595254) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- On the average crosscap number. II: Bounds for a graph (Q2372524) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)
- New bounds for the average genus and average number of faces of a simple graph (Q6080141) (← links)
