The genus polynomials of cross-ladder digraphs in orientable surfaces

DOI10.1007/s11425-007-0125-1zbMath1155.05012OpenAlexW2089611753MaRDI QIDQ943439

Yanpei Liu, Rong-xia Hao

Publication date: 9 September 2008

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0125-1

zbMATH Keywords

surfacesdigraphs in orientable surfacesembedding genus distributiongenus distribution of digraphsgenus distribution of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case ⋮ A note on the directed genus of K_n,n,n and K_n ⋮ Genus distributions for several types of ladder-class graphs ⋮ The genus of the balanced hypercube ⋮ Genera of Cayley maps

Cites Work

• Genus distributions for two classes of graphs
• How to determine the maximum genus of a graph
• Genus distributions for bouquets of circles
• The maximum genus of graphs with diameter three
• Overlap matrices and total imbedding distributions
• Genus distribution of Ringel ladders
• Total embedding distributions for bouquets of circles
• Embedding digraphs on orientable surfaces
• Obstructions to directed embeddings of Eulerian digraphs in the plane
• The genus distributions of directed antiladders in orientable surfaces
• The graph genus problem is NP-complete
• Hierarchy for imbedding-distribution invariants of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: The genus polynomials of cross-ladder digraphs in orientable surfaces