A Nebeský-Type Characterization for Relative Maximum Genus

  title={A Nebesk{\'y}-Type Characterization for Relative Maximum Genus},
  author={Dan Archdeacon and C. Paul Bonnington and Jozef Sir{\'a}n},
  journal={J. Comb. Theory, Ser. B},
This paper concerns the maximum genus orientable surface upon which a given graph cellularly embeds. Classical theorems of Xuong and Nebesk? give exact values for the maximum genus. The former is suited to constructing embeddings while the latter is suited to forbidding embeddings of larger genus. However, using either theorem alone requires an exhaustive search to establish the exact value. Herein we examine relative embeddings of graphs, where certain facial cycles and their orientations have… 

Figures from this paper

Simple greedy 2-approximation algorithm for the maximum genus of a graph
It is proved that removing pairs of adjacent edges from G arbitrarily while retaining connectedness leads to at least at least $\gamma_M(G)/2$ pairs of edges removed, which allows a greedy algorithm for the maximum genus of a graph to be described.
A Note on the Maximum Genus of Graphs with Diameter 4
Let G be a simple graph with diameter four,if G does not contain complete subgraph K3 of order three. We prove that the Betti deficient number of G, �(G) ≤ 2. i.e. the maximum genus of G, M(G) ≥ 1
Odd components of co-trees and graph embeddings
2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA
This paper presents a conceptually easy dynamic programming approach to find a monotonically increasing sequence of the same length that best approximates it in the sense of minimizing the weighted sum of absolute values of the differences.
Special issue in honour of Dan S. Archdeacon: Guest Editorial
On February 15, 2015, Dan Archdeacon passed away at his home in Burlington, Vermont, after a short battle with cancer. Dan was born in Dayton, Ohio, on May 11, 1954. He spent his early years in


Finding a maximum-genus graph imbedding
Topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding, which seems to be the first im Bedding algorithm for which the running time is not exponential in the genus of the imbeding surface.
How to determine the maximum genus of a graph
The Relative Maximum Genus of a Graph
A formula is presented for the maximum (orientable) genus of the surface on which a graph has a relative embedding with respect to a set of closed walks.
Permutation-partition pairs: a combinatorial generalization of graph embeddings
Lemma 3 of [1] makes a false assertion about the winding number w(P, IT). A counterexample to the lemma is obtained by choosing Px = (123), P2 = (654), and n = {{1, 4}, {2, 5}, {3, 6}}. Here w(P,, n)
The Genus, Regional Number, and Betti Number of a Graph
  • R. Duke
  • Mathematics
    Canadian Journal of Mathematics
  • 1966
Let the genus of an orientable 2-manifold M be denoted by γ(M). The genus, γ(G), of a graph G is then the smallest of the numbers γ(N) for orientable 2-manifolds N in which G can be embedded. An
Systems of circuits on two-dimensional manifolds
1. In this paper we first give a method of reducing any two-dimensional manifold to one of the known polygonal normal forms. The method used is one by which a polygon on which the manifold is