Pages that link to "Item:Q1408870"
From MaRDI portal
The following pages link to Maximum genus and chromatic number of graphs (Q1408870):
Displaying 6 items.
- 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, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← links)
- The bounded chromatic number for graphs of genus \(g\) (Q1204466) (← links)
- Results of the maximum genus of graphs (Q2475314) (← links)
