刘彦佩 半闲数学集锦 第4编PDF|Epub|txt|kindle电子书版本网盘下载

刘彦佩 半闲数学集锦 第4编PDF格式电子书版下载

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

4.01[190] New approaches to the graphicness of a matroid1521

4.02[156] Maximum genus and maximum non-separating independent set of a 3-regular graph&Y.Huang1533

4.03[158] Embeddability of graphs on surfaces&Yi.Liu1543

4.04[159] 图的最大亏格与2-因子&黄元秋1553

4.05[160] Embeddings of one kind of graphs&Yi.Liu1563

4.06[163] Some classes of up-embeddable graphs&Y.Huang1569

4.07[164] Maximum genus and 2-factors of graphs&Y.Huang1577

4.08[165] Lower bound number of irreducible graphs on surfaces&Yi.Liu1587

4.09[167] Extensions on 2-edge connected 3-regular up-embeddable graphs&Y.Huang1594

4.10[169] 图的上可嵌入性&黄元秋1604

4.11[171] 图的上可嵌入性与非邻节点度和&黄元秋1610

4.12[172] A characterization of embeddability of graphs on surfaces&Yi.Liu1616

4.13[174] The smallest non-upper embeddable 2-connected 3-regular simplicial graphs&D.M.Li1622

4.14[175] Upper embeddability of graphs&Huang1626

4.15[177] 关于图的最大亏格的一个定理改进&黄元秋1633

4.16[178] On the crossing number of circular graphs&Tongyin Liu1637

4.17[179] The degree-sum of nonadjacent vertices and up-embeddability of graphs&Y.Huang1644

4.18[181] The maximum genus of graphs with diameter thrcc&Y.Huang1650

4.19[187] An efficient algorithm for finding an adjacent matching of a graph&with D.Li1661

4.20[189] The maximum genus of a 3-regular simplicial graph&D.Li1666

4.21[192] New upper bounds on crossing nurnber of circular graphs&R.Hao1678

4.22[195] 图的直径与Betti亏数&黄元秋1684

4.23[198] 图的上可嵌入性的邻域条件&黄元秋1689

4.24[199] A tight lower bound on the maximum genus of 3-edge connected loopless graphs&D.Li1693

4.25[200] A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph&D.Li1700

4.26[203] 关于图的平面可嵌入的一个上可嵌入性&黄元秋1707

4.27[204] Maximum genus，independent number and girth of a graph&Y.Huang1712

4.28[205] 关于图的最大亏格的下界&黄元秋1718

4.29[206] Strong embedding of outer planar near-triangulations on non-orientable surfaces&T.Liu，H.Ren1723

4.30[208] New approaches to the double cover conjecture of graphs1731

4.31[213] Maximum genus and girth of a graph&Y.Huang1736

4.32[214] 关于点的度在Modulo 4下等值的上可嵌入图类&黄元秋1743

4.33[216] Near-triangulations of small circuit double cover with at most n—2&T.Liu1748

4.34[220] Maximum genus，girth and connectivity&D.Li1752

4.35[221] Lower bounds on the maximum genus of loopless multigraphs&D.Li1759

4.36[222] A tight lower bound on the maximum genus of a 3-connected loopless multigraph&D.Li1769

4.37[224] Face size and the maximum genus of graph—1.Simple graphs&Y.Huang1777

4.38[227] A relative maximum genus graph embedding and its local maximum genus&D.Li1792

4.39[229] 平面性理论与布线自动化1799

4.40[230] Determination of regular embeddings of graphs on surfaces&E.Wei1826

4.41[231] Maximum genus and structures of 2-connected cubic simplicial graphs&D.Li1841

4.42[232] 关于（ξ，k）-临界图&黄元秋1849

4.43[233] On 3-connected cubic graphs whose maximum genus attains the bound&D.Li1855

4.44[237] A note on strong embeddings of maximal planar graphs on nonorientable surfaces&T.Liu1861

4.45[242] Boolean approaches to graph embeddings related to VLSI1865

4.46[243] Face size and the maximum genus of graph—2.Nonsimple graphs&Y.Huang1873

4.47[244] 关于直径为4图的最大亏格&黄元秋1885

4.48[245] 图的最大亏格与双重图上的Euler闭迹&黄元秋1891

4.49[260] Equilibrium small circuit double covers of near-triangulations&T.Liu1896

4.50[266] 图的最大亏格与图的着色数&黄元秋1903

4.51[269] Evaluations of crossing numbers by applying auxiliary graphs&R.Hao1912

4.52[277] 一类图的强最大亏格嵌入&魏二玲1919

4.53[282] Strong embeddings of planar graphs on higher surfaces&T.Liu1922

4.54[283] A note of interpolation theorem&E.Wei1929

4.55[286] 完全二部图的少面数强嵌入&魏二玲1934

4.56[287] 图的曲面嵌入Ⅰ1939

4.57[288] On the isomorphisrns of Cayley graphs of Abelian groups&Y.Q.Feng and M.Y.Xu1944

4.58[291] 图的曲面嵌入Ⅱ1960

4.59[293] 图的可定向嵌入的标根可数性&毛林繁1965

4.60[297] 关于图的上可嵌入性的一个新的临域条件&何卫力1972

4.61[298] New automorphism groups identity of trees&L.Mao1977

4.62[301] Maximum genus of strong embeddings&E.L.Wei and H.Ren1982

4.63[307] A note on the maximum genus of graph G3&W.He1992

4.64[308] 从嵌入到地图1997

4.65[313] 关于图的最大亏格的可约与不可约性&黄元秋2002

4.66[319] Strong maximum genus of planar Halin graph&E.Wei2009

4.67[327] Unique embeddings for graphs on orientable surfacespermitting short noncontractible cycles&H.Ren2015