Pages that link to "Item:Q1377685"
From MaRDI portal
The following pages link to Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685):
Displaying 9 items.
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← links)
- Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)