Pages that link to "Item:Q976145"
From MaRDI portal
The following pages link to On the lower bounds for the maximum genus for simple graphs (Q976145):
Displaying 15 items.
- Remarks on the lower bounds for the average genus (Q475705) (← links)
- Lower bounds for the average genus of a CF-graph (Q612933) (← links)
- The bounded chromatic number for graphs of genus \(g\) (Q1204466) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- A note on directed genera of some tournaments (Q1782023) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Lower bounds on the maximum genus of a connected graph (Q2713560) (← links)
- Maximum genus of regular graphs (Q2857401) (← links)
- A new bound on maximum genus of simple graphs. (Q2881239) (← links)
- Maximum genus, connectivity, and Nebeský's Theorem (Q3466844) (← links)
- (Q5091279) (← links)
- (Q5318483) (← links)
- (Q5319635) (← links)