Pages that link to "Item:Q4159393"

The following pages link to A Characterization in of Upper-Embeddable Graphs (Q4159393):

Displaying 46 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)
• The maximum genus of vertex-transitive graphs (Q908931) (← 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)
• The maximum genus of graph bundles (Q1101120) (← links)
• Characterization of the maximum genus of a signed graph (Q1179472) (← links)
• On the number of maximum genus embeddings of almost all graphs (Q1193548) (← links)
• Maximum genus and girth of graphs (Q1297489) (← links)
• Maximum genus and chromatic number of graphs (Q1408870) (← links)
• Maximum genus, girth and connectivity (Q1580675) (← links)
• Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\) (Q1584375) (← 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)
• A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218) (← links)
• Maximum genus and connectivity (Q1910565) (← 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)
• On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
• Up-embeddability of a graph by order and girth (Q2464047) (← links)
• The genus of the balanced hypercube (Q2798321) (← links)
• (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)
• A new characterization of the maximum genus of a graph (Q3939829) (← links)
• $N_2$-locally connected graphs and their upper embeddability (Q4021401) (← 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)
• On the upper embedding of Steiner triple systems and Latin squares (Q4988842) (← links)
• Upper bounds on the bondage number of a graph (Q5009964) (← links)
• On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
• (Q5708581) (← links)
• (Q5708582) (← links)
• An orientation theorem with parity conditions (Q5954236) (← links)