Pages that link to "Item:Q1255962"
From MaRDI portal
The following pages link to How to determine the maximum genus of a graph (Q1255962):
Displaying 45 items.
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← links)
- The maximum genus of graphs of diameter two (Q2276970) (← links)
- Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
- Heffter arrays and biembedding graphs on surfaces (Q2341067) (← links)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353) (← links)
- On the average genus of a graph (Q2366954) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Up-embeddability of a graph by order and girth (Q2464047) (← links)
- Results of the maximum genus of graphs (Q2475314) (← links)
- The genus distributions for a certain type of permutation graphs in orientable surfaces (Q2475335) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)
- Embeddings of a graph into a surface with different weak chromatic numbers (Q2657097) (← links)
- Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions (Q2700409) (← links)
- The genus of the balanced hypercube (Q2798321) (← links)
- Generating nonisomorphic quadrangular embeddings of a complete graph (Q2853333) (← links)
- Maximum genus of regular graphs (Q2857401) (← 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)
- Hierarchy for imbedding-distribution invariants of a graph (Q3784089) (← links)
- Matroids Determine the Embeddability of Graphs in Surfaces (Q3828019) (← links)
- A class of upper-embeddable graphs (Q3858286) (← links)
- A new characterization of the maximum genus of a graph (Q3939829) (← 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)
- Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points (Q4534380) (← links)
- A note on the directed genus of K_n,n,n and K_n (Q4577874) (← links)
- (Q4864765) (← links)
- (Q4886767) (← links)
- On the complexity of graph embeddings (Q5060116) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces (Q5217056) (← links)
- Topological Graph Theory: A Personal Account (Q5300972) (← links)
- EMBEDDING OF METRIC GRAPHS ON HYPERBOLIC SURFACES (Q5380462) (← links)
- (Q5708581) (← links)
- (Q5708582) (← links)
- Configurations of DNA cages based on plane graphs and vertex junctions (Q5870706) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- Face distributions of embeddings of complete graphs (Q6055941) (← links)
- Graph ear decompositions and graph embeddings (Q6184633) (← links)
- A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph (Q6631991) (← links)
