Results 271 to 280 of about 39,087 (298)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 1987
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Denis Hanson, Bjarne Toft
openaire +1 more source
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Denis Hanson, Bjarne Toft
openaire +1 more source
Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
Discrete Mathematics, 2012 In this paper we study the existence of properly colored spanning trees in edge-colored graphs, under certain assumptions on the graph, both structural and related to the coloring.
Y Manoussakis
exaly +2 more sources
Edge Colorings of Embedded Graphs
Graphs and Combinatorics, 2000The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
Yan, Zhongde, Zhao, Yue
openaire +2 more sources
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001 +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao 0001 +4 more
openaire +1 more source
Rainbow matchings in strongly edge-colored graphs
Discrete Mathematics, 2015 A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G).
Jasine Babu, Krishna Vaidyanathan
exaly +2 more sources
Edge coloring of signed graphs
Discrete Applied Mathematics, 2020A signed graph \((G,\sigma)\) is a graph \(G\) with a signature \(\sigma:E(G)\to\{+1,-1\},\) where \(G\) is the underlying graph of \((G,\sigma)\). \textit{T. Zaslavsky} [Discrete Math. 39, 215--228 (1982; Zbl 0487.05027)] started the study of vertex coloring of signed graphs which is to color all vertices of a signed graph \((G,\sigma)\) by a mapping \
Li Zhang +4 more
openaire +2 more sources
Semistrong edge coloring of graphs
Journal of Graph Theory, 2005AbstractWeakening the notion of a strong (induced) matching of graphs, in this paper, we introduce the notion of a semistrong matching. A matching M of a graph G is called semistrong if each edge of M has a vertex, which is of degree one in the induced subgraph G[M]. We strengthen earlier results by showing that for the subset graphs and for the Kneser
András Gyárfás, Alice Hubenko
openaire +2 more sources
On connectivities of edge-colored graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Edge Coloring Series Parallel Graphs
Journal of Algorithms, 1995Abstract We present an algorithm for optimally edge coloring series parallel graphs. We give a linear time implementation, as well as a parallel implementation, of the algorithm that runs in O (log 3 n ) time using O ( n ) processors. The sequential implementation, which is optimal, improves the best-known algorithm. The parallel implementation of
Yuval Caspi, Eliezer Dekel
openaire +1 more source
d-strong Edge Colorings of Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnfried Kemnitz, Massimiliano Marangio
openaire +2 more sources