Graph ear decompositions and graph embeddings

被引:0
|
作者
Chen, J [1 ]
Kanchi, SP
机构
[1] Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA
[2] Kettering Univ, Dept Sci & Mat, Flint, MI 48504 USA
关键词
graph connectivity; graph embedding; ear decomposition; graph maximum genus; algorithm;
D O I
10.1137/S0895480196304234
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Ear decomposition of a graph has been extensively studied in relation to graph connectivity. In this paper, a connection of ear decomposition to graph embeddings is exhibited. It is shown that constructing a maximum-paired ear decomposition of a graph and constructing a maximum-genus embedding of the graph are polynomial-time equivalent. Applications of this connection are discussed.
引用
收藏
页码:229 / 242
页数:14
相关论文
共 50 条