Pages that link to "Item:Q2713560"
From MaRDI portal
The following pages link to Lower bounds on the maximum genus of a connected graph (Q2713560):
Displaying 11 items.
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181) (← 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)
- Maximum genus, independence number and girth (Q1976598) (← links)
- Maximum genus, dominate number and girth of a graph (Q2725256) (← links)
- (Q3059022) (← links)
- Maximum genus, connectivity, and Nebeský's Theorem (Q3466844) (← links)
- (Q5091279) (← links)
- (Q5318483) (← links)
- (Q5319635) (← links)