Pages that link to "Item:Q3939829"
From MaRDI portal
The following pages link to A new characterization of the maximum genus of a graph (Q3939829):
Displayed 45 items.
- Up-embeddability of graphs with new degree-sum (Q523775) (← links)
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- The maximum and minimum genus of a multibranched surface (Q820638) (← links)
- Up-embeddability of graphs with small order (Q847307) (← links)
- The maximum genus of vertex-transitive graphs (Q908931) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- A sufficient condition on upper embeddability of graphs (Q989758) (← links)
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← links)
- The maximum genus of graph bundles (Q1101120) (← links)
- Upper embeddability of graphs (Q1128130) (← links)
- Characterization of the maximum genus of a signed graph (Q1179472) (← links)
- A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
- The maximum genus of graphs with diameter three (Q1297478) (← links)
- Extensions on 2-edge connected 3-regular up-embeddable graphs (Q1299840) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← 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)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
- Maximum genus and connectivity (Q1910565) (← links)
- Multibranched surfaces in 3-manifolds (Q2027330) (← links)
- The maximum genus of graphs of diameter two (Q2276970) (← links)
- Up-embeddability of a graph by order and girth (Q2464047) (← links)
- Matroid matching with Dilworth truncation (Q2476281) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)
- (Q2857401) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- A note on upper embeddable graphs (Q3666871) (← links)
- (Q3708051) (← links)
- On locally quasiconnected graphs and their upper embeddability (Q3708824) (← links)
- On 2-cell embeddings of graphs with minimum numbers of regions (Q3712348) (← links)
- $N_2$-locally connected graphs and their upper embeddability (Q4021401) (← links)
- (Q4022063) (← links)
- Local properties and upper embeddability of connected multigraphs (Q4276520) (← links)
- (Q4277394) (← links)
- The maximum genus, matchings and the cycle space of a graph (Q4515306) (← links)
- (Q4864765) (← links)
- (Q4886767) (← links)
- (Q5708581) (← links)
- (Q5708582) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)