Results 271 to 280 of about 1,522,114 (310)
Some of the next articles are maybe not open access.
Edge‐colorings avoiding rainbow stars
Journal of Graph Theory, 2017AbstractWe consider an extremal problem motivated by a article of Balogh [J. Balogh, A remark on the number of edge colorings of graphs, European Journal of Combinatorics 27, 2006, 565–573], who considered edge‐colorings of graphs avoiding fixed subgraphs with a prescribed coloring.
Carlos Hoppen +3 more
openaire +1 more source
2007
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
We consider the following channel assignment problem arising in wireless networks. We are given a graph G= (V, E), and the number of wireless cards C v for all v, which limit the number of colors that edges incident to vcan use. We also have the total number of channels C G available in the network.
Chadi Kari +4 more
openaire +1 more source
1995
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. In this paper, we survey recent advances and results on the classical edge-coloring problem as well as the generalized edge-coloring problems, called the f-coloring and Φ ...
Shin-ichi Nakano +2 more
openaire +1 more source
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
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
Note on injective edge-coloring of graphs
Discrete Applied Mathematics, 2022Z. Miao, Yimin Song, Gexin Yu
semanticscholar +1 more source
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
Resource Scheduling in Edge Computing: A Survey
IEEE Communications Surveys and Tutorials, 2021Quyuan Luo, Shihong Hu, Changle Li
exaly