نتایج جستجو برای: edge coloring
تعداد نتایج: 121455 فیلتر نتایج به سال:
A graph G is called a complete k-partite (k ≥ 2) graph if its vertices can be partitioned into k independent sets V1, . . . , Vk such that each vertex in Vi is adjacent to all the other vertices in Vj for 1 ≤ i < j ≤ k. A complete k-partite graph G is a complete balanced kpartite graph if |V1| = |V2| = · · · = |Vk|. An edge-coloring of a graph G with colors 1, . . . , t is an interval t-colorin...
An edge coloring of a graph G with colors 1, 2, . . . , t is called an interval t-coloring if for each i ∈ {1, 2, . . . , t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let N be the set of all i...
An edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smalle...
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree ∆ and with no isolated edges has an avd-coloring with at most ∆ + 300 colors, provided that ∆ > 1020. AMS Subject Classification: 05C15
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Among the results presented are formulas for th...
An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each color c and each face f of G, either an odd number of edges incident with f is colored with c, or color c does not occur on the edges of f . In th...
It was proved that every 3-connected bipartite graph admits a vertex-coloring S-edge-weighting for S = {1, 2} (H. Lu, Q. Yu and C. Zhang, Vertex-coloring 2-edge-weighting of graphs, European J. Combin., 32 (2011), 22-27). In this paper, we show that every 2-connected and 3-edge-connected bipartite graph admits a vertex-coloring S-edgeweighting for S ∈ {{0, 1}, {1, 2}}. These bounds we obtain ar...
An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic (2colored) cycles. The acyclic chromatic index of a graph G, denoted by a(G), is the least integer k such that G admits an acyclic edge-coloring using k colors. Let ∆ = ∆(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by Kn,n. Basavaraju, C...
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ a (G). We prove that χ a (G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges w...
A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index χspGq of a graph G is the minimum number of colors in a strong edge coloring of G. Let ∆ ě 4 be an integer. In this note, we study the properties of the odd graphs, and show that every planar graph with maximum degree at most ∆ and girth at least 10∆ ́ 4 has a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید