A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong ed...A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x'as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △A(G)≥5.展开更多
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.展开更多
基金Supported by NNSFC(19871036)"Qing Lan"talent funds of Lanzhou Railway Institute.
文摘A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x'as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △A(G)≥5.
基金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.
