A Characterization in of Upper-Embeddable Graphs

DOI10.2307/1998852zbMath0379.05025OpenAlexW4251241852MaRDI QIDQ4159393

Mark Jungerman

Publication date: 1978

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1998852

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (46)

Up-embeddability of graphs with small order ⋮ The maximum genus of graph bundles ⋮ Upper bounds for domination related parameters in graphs on surfaces ⋮ Maximum genus and connectivity ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ A note on disjoint cycles ⋮ Maximum genus and chromatic number of graphs ⋮ The maximum genus of vertex-transitive graphs ⋮ Characterization of the maximum genus of a signed graph ⋮ Up-embeddability of a graph by order and girth ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Up-embeddability of graphs with new degree-sum ⋮ On Rooted Packings, Decompositions, and Factors of Graphs ⋮ Unnamed Item ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ A note on upper embeddable graphs ⋮ A new characterization of the maximum genus of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The maximum genus of graphs of diameter two ⋮ An orientation theorem with parity conditions ⋮ The genus of the balanced hypercube ⋮ On the upper embedding of symmetric configurations with block size 3 ⋮ The maximum genus of a 3-regular simplicial graph ⋮ Local properties and upper embeddability of connected multigraphs ⋮ On locally quasiconnected graphs and their upper embeddability ⋮ Unnamed Item ⋮ On 2-cell embeddings of graphs with minimum numbers of regions ⋮ Polynomial cases of graph decomposition: A complete solution of Holyer's problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the upper embedding of Steiner triple systems and Latin squares ⋮ Unnamed Item ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ Upper embeddability, edge independence number and girth ⋮ Maximum genus, girth and connectivity ⋮ Maximum genus and girth of graphs ⋮ Triangular embeddings of \(K_n-K_m\) with unboundedly large \(m\) ⋮ A note on the maximum genus of 3-edge-connected nonsimple graphs ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ Upper bounds on the bondage number of a graph ⋮ $N_2$-locally connected graphs and their upper embeddability ⋮ Lower bounds on the maximum genus of loopless multigraphs ⋮ A tight lower bound on the maximum genus of a 3-connected loopless multigraph ⋮ A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs ⋮ The maximum genus, matchings and the cycle space of a graph

This page was built for publication: A Characterization in of Upper-Embeddable Graphs