Pages that link to "Item:Q2546205"
From MaRDI portal
The following pages link to A Kuratowski-type theorem for the maximum genus of a graph (Q2546205):
Displaying 24 items.
- A note on disjoint cycles (Q413261) (← links)
- Characterization of signed graphs which are cellularly embeddable in no more than one surface (Q1182736) (← 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)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- Graphs of given genus and arbitrarily large maximum genus (Q1845245) (← links)
- Bounds for the average genus of the vertex-amalgamation of graphs (Q1896359) (← links)
- A tight lower bound on the maximum genus of a simplicial graph (Q1923508) (← links)
- Genus polynomials of ladder-like sequences of graphs (Q2196486) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Nonorientable genera of Petersen powers (Q2343443) (← links)
- On the average crosscap number. II: Bounds for a graph (Q2372524) (← links)
- Up-embeddability of a graph by order and girth (Q2464047) (← links)
- Structure for a graph with average genus (Q2504073) (← links)
- The total embedding distributions of cacti and necklaces (Q2505410) (← links)
- On 2-cell embeddings of graphs with minimum numbers of regions (Q3712348) (← links)
- Hierarchy for imbedding-distribution invariants of a graph (Q3784089) (← links)
- Sulla tracciabilita' di grafi finiti su superficie compatte (Q3890713) (← links)
- A new characterization of the maximum genus of a graph (Q3939829) (← links)
- Survey of results on the maximum genus of a graph (Q4182771) (← links)
- The embeddings of a graph—A survey (Q4192084) (← links)
- The maximum genus, matchings and the cycle space of a graph (Q4515306) (← links)
