Pages that link to "Item:Q1255962"

The following pages link to How to determine the maximum genus of a graph (Q1255962):

Displaying 50 items.

• Minimum genus embeddings of the complete graph (Q335320) (← links)
• A note on disjoint cycles (Q413261) (← links)
• 2-cell embeddings with prescribed face lengths and genus (Q659597) (← 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)
• Edge decomposition of connected claw-free cubic graphs (Q777388) (← links)
• The maximum and minimum genus of a multibranched surface (Q820638) (← links)
• A note on the computational complexity of graph vertex partition (Q868398) (← links)
• The maximum genus of vertex-transitive graphs (Q908931) (← links)
• The genus polynomials of cross-ladder digraphs in orientable surfaces (Q943439) (← 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)
• 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)
• Fundamental cycles and graph embeddings (Q1044271) (← 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)
• On the number of maximum genus embeddings of almost all graphs (Q1193548) (← links)
• Upper-embeddable graphs and related topics (Q1255963) (← links)
• Searching for a strong double tracing in a graph (Q1265251) (← links)
• A Nebeský-type characterization for relative maximum genus (Q1272649) (← links)
• Maximum genus and girth of graphs (Q1297489) (← links)
• Overlap matrices and total imbedding distributions (Q1322173) (← links)
• On the orbits of the product of two permutations (Q1331933) (← links)
• Maximum genus and chromatic number of graphs (Q1408870) (← links)
• Maximum genus of strong embeddings (Q1432858) (← links)
• Maximum genus, girth and connectivity (Q1580675) (← 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)
• 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)
• New formulae for the decycling number of graphs (Q1630929) (← links)
• Odd components of co-trees and graph embeddings (Q1733528) (← links)
• A note on decycling number, vertex partition and AVD-total coloring in graphs (Q1756100) (← links)
• Maximum genus embeddings of Steiner triple systems (Q1767628) (← links)
• A note on directed genera of some tournaments (Q1782023) (← links)
• The maximum genus of a 3-regular simplicial graph (Q1807872) (← links)
• Straight-ahead walks in Eulerian graphs (Q1827714) (← links)
• Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
• Embedding digraphs on orientable surfaces (Q1850600) (← links)
• Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← 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)
• Constructing infinite one-regular graphs (Q1970080) (← links)
• Antiparallel \(d\)-stable traces and a stronger version of ore problem (Q2014350) (← links)
• Multibranched surfaces in 3-manifolds (Q2027330) (← links)