Results 331 to 340 of about 1,425,497 (376)
On-Line Edge-Coloring with a Fixed Number of Colors [PDF]
Algorithmica, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Favrholdt, Lene Monrad +1 more
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Injective edge-coloring of subcubic graphs
Discret. Math. Algorithms Appl., 2021An injective edge-coloring [Formula: see text] of a graph [Formula: see text] is an edge-coloring such that if [Formula: see text], [Formula: see text], and [Formula: see text] are three consecutive edges in [Formula: see text] (they are consecutive if ...
Baya Ferdjallah +2 more
semanticscholar +1 more source
ColorED: Color edge and segment detection by Edge Drawing (ED)
Journal of Visual Communication and Image Representation, 2017Abstract We extend our recent edge and segment detector, Edge Drawing (GrayED), to detect edge segments in color images. Edge Drawing for color images, named ColorED, takes in a color image, and outputs a set of edge segments, each a contiguous, 1-pixel wide chain of pixels.
Akınlar, Cüneyt, Topal, Cihan
openaire +3 more sources
Faster Vizing and Near-Vizing Edge Coloring Algorithms
ACM-SIAM Symposium on Discrete AlgorithmsVizing's celebrated theorem states that every simple graph with maximum degree $\Delta$ admits a $(\Delta+1)$ edge coloring which can be found in $O(m \cdot n)$ time on $n$-vertex $m$-edge graphs.
Sepehr Assadi
semanticscholar +1 more source
Journal of Mathematics and Physics
We develop the theory of the edge coloring of lattice graphs. A central role is played by a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a proper edge coloring of the entire lattice graph by ...
Joris Kattemölle
semanticscholar +1 more source
We develop the theory of the edge coloring of lattice graphs. A central role is played by a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a proper edge coloring of the entire lattice graph by ...
Joris Kattemölle
semanticscholar +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 +3 more sources
Recent progress on strong edge-coloring of graphs
Discret. Math. Algorithms Appl., 2019A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
Kecai Deng, Gexin Yu, Xiangqian Zhou
semanticscholar +1 more source
Tight Lower Bounds for List Edge Coloring
Scandinavian Workshop on Algorithm Theory, 2018The fastest algorithms for edge coloring run in time $2^m n^{O(1)}$, where $m$ and $n$ are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes $2^{\Theta(n^2)}$.
Lukasz Kowalik, Arkadiusz Socala
semanticscholar +1 more source
Journal of Graph Theory, 1990
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Odile Marcotte, Paul Seymour
openaire +2 more sources
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Odile Marcotte, Paul Seymour
openaire +2 more sources
Note on injective edge-coloring of graphs
Discrete Applied Mathematics, 2022Z. Miao, Yimin Song, Gexin Yu
semanticscholar +1 more source