Abstract:Abstract If G is a bipartite graph with bipartition A, B then let G m,n (A, B) be obtained from G by replacing each vertex a of A by an independent set a 1 , …, a m , each vertex b of B by an independ...Abstract If G is a bipartite graph with bipartition A, B then let G m,n (A, B) be obtained from G by replacing each vertex a of A by an independent set a 1 , …, a m , each vertex b of B by an independent set b 1 ,…, b n , and each edge ab of G by the complete bipartite graph with edges a i b j (1 ≤ i ≤ m and 1 ≤ j ≤ n ). Whenever G has certain types of spanning forests, then cellular embeddings of G in surfaces S may be lifted to embeddings of G m,n (A, B) having faces of the same sizes as those of G in S . These results are proved by the technique of “excess‐current graphs.” They include new genus embeddings for a large class of bipartite graphs.Read More
Publication Year: 1983
Publication Date: 1983-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 10
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot