摘要
Thelowerboundsonthemaximumgenusoflooplessgraphsareobtainedaccordingtotheconnectivityofthesegraphs.ThisnotonlyanswersaquestionofChen,ArchdeaconandGross,butalsogeneralizesthepreviousknownresults.Thus,apictureofthelowerboundsonthemaximumgenusoflooplessmultigraphsispresented.
出版日期
2000年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)