Results 221 to 230 of about 5,178 (231)

Strong edge-coloring of $(3, Δ)$-bipartite graphs

Discret. Math., 2014
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum degree $Δ$. For every such graph, we prove that a strong $4Δ$-edge-coloring can always be obtained.
Julien Bensmail, Aurélie Lagoutte, Petru Valicov   +2 more
openaire   +2 more sources

Strong Edge Colorings of Graphs

2015
In the preceding chapters we have discussed unrestricted edge colorings that, in a variety of ways, induce vertex colorings that are either vertex-distinguishing or neighbor-distinguishing. In this chapter, we turn our attention from unrestricted edge colorings to proper edge colorings that induce set-defined vertex colorings which are either vertex ...
openaire   +1 more source

On strong edge-coloring of graphs with maximum degree 4

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Xiangwen Li, Gexin Yu
openaire   +1 more source

The strong edge colorings of a sparse random graph [PDF]

Australas. J Comb., 1998
The strong chromatic index of a graph is the smallest integer \(k\) such that the edge set can be partitioned into \(k\) induced subgraphs which are matchings. In this paper the behavior of the strong chromatic index of a sparse, binomial random graph is studied.
openaire   +1 more source

Strong Edge Coloring of Subquartic Graphs

2023
Junlei Zhu, Hongguo Zhu
openaire   +1 more source

Strong Edge Coloring of Outerplane Graphs with Independent Crossings

Acta Mathematicae Applicatae Sinica, English Series
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Ke-Jie, Zhang, Xin
openaire   +2 more sources

Strong Edge-Coloring of Hamming Graphs

Proceedings of Computer Science and Information Technologies 2023 Conference, 2023
Aram Drambyan, Petros Petrosyan
openaire   +1 more source

List strong edge-coloring of graphs with maximum degree 4

Discrete Mathematics, 2020
Donglei Yang, Meijie Ma
exaly  

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Discrete Mathematics, 2006
Daniel Cranston
exaly  

A polynomial time algorithm for strong edge coloring of partial k-trees

Discrete Applied Mathematics, 2004
Mohammad Salavatipour
exaly