In this paper various kinds of fair near-triangulations are enumerated and several other types of near-triangulations are counted with the root-face valency, the number of edges and faces as the parameters.
A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. ...A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. Let Then, C0 is said to he an equilibrium SCDC of G. In this paper, we show that if G is an outer planar graph, δ(C0)≤2, otherwiseδ(C0) ≤4.展开更多
文摘In this paper various kinds of fair near-triangulations are enumerated and several other types of near-triangulations are counted with the root-face valency, the number of edges and faces as the parameters.
基金Supported by the National Natural Science Foundation of China (69973001)
文摘A near-triangulation is such a connected planar graph whose inner faces are all triangles but the outer face may be not. Let G be a near-triangulation of order n and C be an SCDC (small circuit double cover)[2] of G. Let Then, C0 is said to he an equilibrium SCDC of G. In this paper, we show that if G is an outer planar graph, δ(C0)≤2, otherwiseδ(C0) ≤4.
