Maximum genus of a graph in terms of its embedding properties

Authors:
Yuanqiu Huang
Affiliations:
Department of Mathematics, Normal University of Hunan, Changsha 410081, People's Republic of China
Venue:
Discrete Mathematics
Year:
2003

Citing 8
Cited 0

Topological graph theory

Topological graph theory
The maximum genus of graphs of diameter two

Discrete Mathematics
Maximum genus and connectivity

Discrete Mathematics
A tight lower bound on the maximum genus of a simplicial graph

Discrete Mathematics
Maximum genus and maximum nonseparating independent set of a 3-regular graph

Discrete Mathematics
The maximum genus of graphs with diameter three

Discrete Mathematics
Maximum genus and girth of graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.06

Visualization

Abstract

Let G be a graph that is cellularly embedded in the projective plane such that the dual graph is Hamiltonian. Then we prove that G is upper embeddable. In the meantime we also obtain the same result for other general orientable surfaces if the dual graph contains a separating Hamilton circuit.