Results 251 to 260 of about 14,669 (262)
Some of the next articles are maybe not open access.
Maximal Edge-Colorings of Graphs
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Meszka, Magdalena Tyniec
openaire +2 more sources
Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Cao +4 more
openaire +2 more sources
2016
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
In [76], a number of edge colorings were described that gave rise to various vertex colorings of interest. In one instance, the color of a vertex was defined as the set of colors of the edges incident with the vertex, with the goal to minimize the number of colors so that the resulting coloring is vertex-distinguishing.
openaire +1 more source
Graph Edge Coloring and Extensions of Edge Colorings
This dissertation explores two main questions which may be framed in terms of graph edge-coloring. First, an assignment of $k$ colors to the edges of the complete bipartite graph $K_{n,n}$ corresponds to an assignment of $k$ symbols to the cells of an $n\times n$ array.openaire +1 more source
2016
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source
In this chapter, we consider an edge coloring problem in graphs that can be used to model certain situations, one of which we now describe. Suppose that a hard-line network of n computers is to be constructed. Each of these computers requires k different types of connections.
openaire +1 more source