The following pages link to On the maximum genus of a graph (Q2546204):
Displaying 43 items.
- Genus distributions for iterated claws (Q405081) (← 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)
- 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)
- On the maximum genus of some graphs with upper imbeddable subgraphs (Q1242171) (← links)
- An additivity theorem for maximum genus of a graph (Q1244241) (← links)
- How to determine the maximum genus of a graph (Q1255962) (← links)
- Upper-embeddable graphs and related topics (Q1255963) (← links)
- Upper embeddability and connectivity of graphs (Q1257900) (← links)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
- The maximum genus of graphs with diameter three (Q1297478) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Extensions on 2-edge connected 3-regular up-embeddable graphs (Q1299840) (← links)
- Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← links)
- A note on the maximum genus of 3-edge-connected nonsimple graphs (Q1589799) (← links)
- A relative maximum genus graph embedding and its local maximum genus (Q1594860) (← links)
- A tight lower bound on the maximum genus of a 3-connected loopless multigraph (Q1595254) (← links)
- Graphs of given genus and arbitrarily large maximum genus (Q1845245) (← links)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- The maximum genus of graphs of diameter two (Q2276970) (← links)
- Up-embeddability of a graph by order and girth (Q2464047) (← links)
- A Kuratowski-type theorem for the maximum genus of a graph (Q2546205) (← links)
- A note on upper embeddable graphs (Q3666871) (← links)
- A class of upper-embeddable graphs (Q3858286) (← links)
- Sulla tracciabilita' di grafi finiti su superficie compatte (Q3890713) (← links)
- A note on conservative graphs (Q3898515) (← links)
- A new characterization of the maximum genus of a graph (Q3939829) (← links)
- The combinatorial map color theorem (Q4166773) (← links)
- Survey of results on the maximum genus of a graph (Q4182771) (← links)
- (Q4277394) (← links)
- The maximum genus, matchings and the cycle space of a graph (Q4515306) (← links)
- Topological Graph Theory: A Personal Account (Q5300972) (← links)
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings (Q5921215) (← links)
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings (Q5921407) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- Face distributions of embeddings of complete graphs (Q6055941) (← links)
