Pages that link to "Item:Q4159393"
From MaRDI portal
The following pages link to A Characterization in of Upper-Embeddable Graphs (Q4159393):
Displaying 15 items.
- Upper bounds for domination related parameters in graphs on surfaces (Q334124) (← links)
- A note on disjoint cycles (Q413261) (← links)
- Up-embeddability of graphs with new degree-sum (Q523775) (← links)
- Up-embeddability of graphs with small order (Q847307) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← 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)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
- Upper bounds on the bondage number of a graph (Q5009964) (← links)
