The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that ...The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.展开更多
An incidence of a graph G is a vertex-edge pair(v,e)such that v is incidence with e.A conflict-free incidence coloring of a graph is a coloring of the incidences in such a way that two incidences(u,e)and(v,f)get disti...An incidence of a graph G is a vertex-edge pair(v,e)such that v is incidence with e.A conflict-free incidence coloring of a graph is a coloring of the incidences in such a way that two incidences(u,e)and(v,f)get distinct colors if and only if they conflict each other,i.e.,(i)u=v,(ii)uv is e or f,or(iii)there is a vertex w such that uw=e and vw=f.The minimum number of colors used among all conflict-free incidence colorings of a graph is the conflict-free incidence chromatic number.A graph is outer-1-planar if it can be drawn in the plane so that vertices are on the outer-boundary and each edge is crossed at most once.In this paper,we show that the conflict-free incidence chromatic number of an outer-1-planar graph with maximum degree△is either 2△or 2△+1 unless the graph is a cycle on three vertices,and moreover,all outer-1-planar graphs with conflict-free incidence chromatic number 2△or 2△+1 are completely characterized.An efficient algorithm for constructing an optimal conflict-free incidence coloring of a connected outer-1-planar graph is given.展开更多
An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles in G.The acyclic chromatic index χ'α(G) of G is the smallest k such that G has an acyclic edge coloring u...An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles in G.The acyclic chromatic index χ'α(G) of G is the smallest k such that G has an acyclic edge coloring using k colors.It was conjectured that every simple graph G with maximum degree Δ has χ'_α(G) ≤Δ+2.A1-planar graph is a graph that can be drawn in the plane so that each edge is crossed by at most one other edge.In this paper,we show that every 1-planar graph G without 4-cycles has χ'_α(G)≤Δ+22.展开更多
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that each 1-planar graph with maximum degree △ is （A ＋ 1）-edge-choosable and...A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that each 1-planar graph with maximum degree △ is （A ＋ 1）-edge-choosable and （△ ＋ 2）- total-choosable if △ ≥ 16, and is A-edge-choosable and （△ ＋ 1）-total-ehoosable if △ ≥21. The second conclusion confirms the list coloring conjecture for the class of 1-planar graphs with large maximum degree.展开更多
The linear 2-arboricity la2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.In this paper,we prove that if G is a ...The linear 2-arboricity la2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.In this paper,we prove that if G is a 1-planar graph with maximum degree Δ,then la_(2)(G)≤[(Δ+1)/2]+7.This improves a known result of Liu et al.(2019) that every 1-planar graph G has la_(2)(G)≤[(Δ+1)/2]+14.We also observe that there exists a 7-regular 1-planar graph G such that la2(G)=6=[(Δ+1)/2]+2,which implies that our solution is within 6 from optimal.展开更多
A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph with minimum degree 7 contains a copy of K2 V （K1 ∪ K2...A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph with minimum degree 7 contains a copy of K2 V （K1 ∪ K2） with all vertices of degree at most 12. In addition, we also prove the existence of a graph K1 V （K1∪K2） with relatively small degree vertices in 1-planar graphs with minimum degree at least 6.展开更多
A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by X＇a（G）, is the least number of colors such that G has an acyclic edge coloring. A gra...A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by X＇a（G）, is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that X＇a（G） ≤△ A（G）＋ 22, if G is a triangle-free 1-planar graph.展开更多
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A plane graph with near-independent crossings or independent crossings, say NIC-planar graph or IC-planar graph...A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A plane graph with near-independent crossings or independent crossings, say NIC-planar graph or IC-planar graph, is a 1-planar graph with the restriction that for any two crossings the four crossed edges are incident with at most one common vertex or no common vertices, respectively. In this paper, we prove that each 1-planar graph, NIC-planar graph or IC-planar graph with maximum degree A at least 15, 13 or 12 has an equitable △-coloring, respectively. This verifies the well-known Chen-Lih-Wu Conjecture for three classes of 1-planar graphs and improves some known results.展开更多
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we prove that every 1-planar graph G with maximum degree △（G） 〉 12 and girth at least five...A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we prove that every 1-planar graph G with maximum degree △（G） 〉 12 and girth at least five is totally （△（G）＋1）-colorable.展开更多
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Mat...A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Math 312:2788-2799,2012;MR2945171)proved that the linear arboricity of every outer-1-planar graph with maximum degree△is exactly[△/2] provided that△=3or△≥5 and claimed that there are outer-1-planar graphs with maximum degree △=4 and linear arboricity[[(O+1)/2]=3.It is shown in this paper that the linear arboricity of every outer-1-planar graph with maximum degree 4 is exactly 2 provided that it admits an outer-1-planar drawing with crossing distance at least 1 and crossing width at least 2,and moreover,none of the above constraints on the crossing distance and Crossing width can be removed..Besides,a polynomial-time algorithm for constructing a path-2-coloring(i.e.,an edge 2-coloring such that each color class induces a linear forest,a disjoint union of paths)of such an outer-1-planar drawing is given.展开更多
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we verify the total coloring conjecture for every 1-planar graph G if either △（G） ≥9 and g...A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we verify the total coloring conjecture for every 1-planar graph G if either △（G） ≥9 and g（G）≥ 4, or △（G） ≥ 7 and g（G）≥5, where △（G） is the maximum degree of G and g（G） is the girth of G.展开更多
A graph is 1-planar if it can be drawn on the Euclidean plane so that each edge is crossed by at most one other edge.A proper vertex k-coloring of a graph G is defined as a vertex coloring from a set of k colors such ...A graph is 1-planar if it can be drawn on the Euclidean plane so that each edge is crossed by at most one other edge.A proper vertex k-coloring of a graph G is defined as a vertex coloring from a set of k colors such that no two adjacent vertices have the same color.A graph that can be assigned a proper k-coloring is k-colorable.A cycle is a path of edges and vertices wherein a vertex is reachable from itself.A cycle contains k vertices and k edges is a k-cycle.In this paper,it is proved that 1-planar graphs without 4-cycles or 5-cycles are 5-colorable.展开更多
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.It is known that the list edge chromatic numberχ′l(G)of any outer-1-planar g...A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.It is known that the list edge chromatic numberχ′l(G)of any outer-1-planar graph G with maximum degreeΔ(G)≥5 is exactly its maximum degree.In this paper,we proveχ′l(G)=Δ(G)for outer-1-planar graphs G withΔ(G)=4 and with the crossing distance being at least 3.展开更多
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once.In this paper,we study 1-planar graph joins.We prove that the join G ＋ H is 1-planar if and only if the pair ...A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once.In this paper,we study 1-planar graph joins.We prove that the join G ＋ H is 1-planar if and only if the pair [G,H] is subgraph-majorized by one of pairs [C3 ∪ C3,C3],[C4,C4],[C4,C3],[K2,1,1,P3] in the case when both elements of the graph join have at least three vertices.If one element has at most two vertices,then we give several necessary/sufficient conditions for the bigger element.展开更多
文摘The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.
基金supported by the Research Funds for the Central Universities(No.QTZX22053)the National Natural Science Foundation of China(No.11871055)。
文摘An incidence of a graph G is a vertex-edge pair(v,e)such that v is incidence with e.A conflict-free incidence coloring of a graph is a coloring of the incidences in such a way that two incidences(u,e)and(v,f)get distinct colors if and only if they conflict each other,i.e.,(i)u=v,(ii)uv is e or f,or(iii)there is a vertex w such that uw=e and vw=f.The minimum number of colors used among all conflict-free incidence colorings of a graph is the conflict-free incidence chromatic number.A graph is outer-1-planar if it can be drawn in the plane so that vertices are on the outer-boundary and each edge is crossed at most once.In this paper,we show that the conflict-free incidence chromatic number of an outer-1-planar graph with maximum degree△is either 2△or 2△+1 unless the graph is a cycle on three vertices,and moreover,all outer-1-planar graphs with conflict-free incidence chromatic number 2△or 2△+1 are completely characterized.An efficient algorithm for constructing an optimal conflict-free incidence coloring of a connected outer-1-planar graph is given.
基金Research supported by the National Natural Science Foundation of China (No.12031018)Research supported by the National Natural Science Foundation of China (No.12071048)+3 种基金Research supported by the National Natural Science Foundation of China(No.12071351)Science and Technology Commission of Shanghai Municipality (No.18dz2271000)Doctoral Scientific Research Foundation of Weifang University (No.2021BS01)Natural Science Foundation of Shandong Province (No.ZR2022MA060)。
文摘An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles in G.The acyclic chromatic index χ'α(G) of G is the smallest k such that G has an acyclic edge coloring using k colors.It was conjectured that every simple graph G with maximum degree Δ has χ'_α(G) ≤Δ+2.A1-planar graph is a graph that can be drawn in the plane so that each edge is crossed by at most one other edge.In this paper,we show that every 1-planar graph G without 4-cycles has χ'_α(G)≤Δ+22.
文摘A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that each 1-planar graph with maximum degree △ is （A ＋ 1）-edge-choosable and （△ ＋ 2）- total-choosable if △ ≥ 16, and is A-edge-choosable and （△ ＋ 1）-total-ehoosable if △ ≥21. The second conclusion confirms the list coloring conjecture for the class of 1-planar graphs with large maximum degree.
文摘The linear 2-arboricity la2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.In this paper,we prove that if G is a 1-planar graph with maximum degree Δ,then la_(2)(G)≤[(Δ+1)/2]+7.This improves a known result of Liu et al.(2019) that every 1-planar graph G has la_(2)(G)≤[(Δ+1)/2]+14.We also observe that there exists a 7-regular 1-planar graph G such that la2(G)=6=[(Δ+1)/2]+2,which implies that our solution is within 6 from optimal.
基金Supported by National Natural Science Foundation of China (Grant Nos. 10971121, 11026184, 61070230)Research Fund for the Doctoral Program of Higher Education (Grant No. 20100131120017)+1 种基金Graduate Independent Innovation Foundation of Shandong University (Grant No. yzc10040)the financial support from the Chinese Ministry of Education Prize for Academic Doctoral Fellows
文摘A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this paper, it is shown that each 1-planar graph with minimum degree 7 contains a copy of K2 V （K1 ∪ K2） with all vertices of degree at most 12. In addition, we also prove the existence of a graph K1 V （K1∪K2） with relatively small degree vertices in 1-planar graphs with minimum degree at least 6.
基金Supported by National Natural Science Foundation of China(Grant No.11271365)
文摘A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G, denoted by X＇a（G）, is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that X＇a（G） ≤△ A（G）＋ 22, if G is a triangle-free 1-planar graph.
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010)the Fundamental Research Funds for the Central Universities(No.JB170706)+5 种基金the Specialized Research Fund for the Doctoral Program of Higher Education(No.20130203120021)the National Natural Science Foundation of China(No.11301410)the National Natural Science Foundation of China(No.11501316)the Shandong Provincial Natural Science Foundation,China(No.ZR2014AQ001)the China Postdoctoral Science Foundation(No.2015M570569)supported by the Natural Science Foundation of Xinjiang Province of China(No.2015211A003)
文摘A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. A plane graph with near-independent crossings or independent crossings, say NIC-planar graph or IC-planar graph, is a 1-planar graph with the restriction that for any two crossings the four crossed edges are incident with at most one common vertex or no common vertices, respectively. In this paper, we prove that each 1-planar graph, NIC-planar graph or IC-planar graph with maximum degree A at least 15, 13 or 12 has an equitable △-coloring, respectively. This verifies the well-known Chen-Lih-Wu Conjecture for three classes of 1-planar graphs and improves some known results.
基金supported by National Natural Science Foundation of China(Grant No.11271006)
文摘A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we prove that every 1-planar graph G with maximum degree △（G） 〉 12 and girth at least five is totally （△（G）＋1）-colorable.
基金supported by the Fundamental Research Funds for the Central Universities(No.JB170706)the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010)+2 种基金the National Natural Science Foundation of China(Nos.11871055 and 11301410)supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JQ1031)the National Natural Science Foundation of China(Nos.11701440 and 11626181).
文摘A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Math 312:2788-2799,2012;MR2945171)proved that the linear arboricity of every outer-1-planar graph with maximum degree△is exactly[△/2] provided that△=3or△≥5 and claimed that there are outer-1-planar graphs with maximum degree △=4 and linear arboricity[[(O+1)/2]=3.It is shown in this paper that the linear arboricity of every outer-1-planar graph with maximum degree 4 is exactly 2 provided that it admits an outer-1-planar drawing with crossing distance at least 1 and crossing width at least 2,and moreover,none of the above constraints on the crossing distance and Crossing width can be removed..Besides,a polynomial-time algorithm for constructing a path-2-coloring(i.e.,an edge 2-coloring such that each color class induces a linear forest,a disjoint union of paths)of such an outer-1-planar drawing is given.
基金Supported by the scientific research program of Xinjiang Uygur Autonomous Region grant 2016D01C012 the Scientific Research Program(XJEDU2016I046)of the Higher Education Institution of Xinjiang
文摘A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we verify the total coloring conjecture for every 1-planar graph G if either △（G） ≥9 and g（G）≥ 4, or △（G） ≥ 7 and g（G）≥5, where △（G） is the maximum degree of G and g（G） is the girth of G.
基金supported by the National Natural Science Foundation of China(Grant No.12071265)the Natural Science Foundation of Shandong Province(Grant No.ZR2019MA032)。
文摘A graph is 1-planar if it can be drawn on the Euclidean plane so that each edge is crossed by at most one other edge.A proper vertex k-coloring of a graph G is defined as a vertex coloring from a set of k colors such that no two adjacent vertices have the same color.A graph that can be assigned a proper k-coloring is k-colorable.A cycle is a path of edges and vertices wherein a vertex is reachable from itself.A cycle contains k vertices and k edges is a k-cycle.In this paper,it is proved that 1-planar graphs without 4-cycles or 5-cycles are 5-colorable.
基金supported by the National Natural Science Foundation of China (Nos. 11871055,11301410)the Youth Talent Support Plan of Xi’an Association for Science and Technology,China (2018-6)
文摘A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.It is known that the list edge chromatic numberχ′l(G)of any outer-1-planar graph G with maximum degreeΔ(G)≥5 is exactly its maximum degree.In this paper,we proveχ′l(G)=Δ(G)for outer-1-planar graphs G withΔ(G)=4 and with the crossing distance being at least 3.
基金Supported by the Agency of Slovak Ministry of Education for the Structural Funds of the EU under project ITMS:26220120007by Science and Technology Assistance Agency under the contract No.APVV-0023-10by Slovak VEGA grant No.1/0652/12
文摘A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once.In this paper,we study 1-planar graph joins.We prove that the join G ＋ H is 1-planar if and only if the pair [G,H] is subgraph-majorized by one of pairs [C3 ∪ C3,C3],[C4,C4],[C4,C3],[K2,1,1,P3] in the case when both elements of the graph join have at least three vertices.If one element has at most two vertices,then we give several necessary/sufficient conditions for the bigger element.
基金National Natural Science Foundation of China(10971121,11101243,61070230)The Research Fund for the Doctoral Program of Higher Education(20100131120017) Graduate Independent Innovation Foundation of Shandong University(yzc10040)
