Results 231 to 240 of about 60,707 (240)

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 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 Subquartic Graphs

2023
Junlei Zhu, Hongguo Zhu
openaire   +1 more source

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
Meijie Ma, Donglei Yang
exaly  

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

Discrete Mathematics, 2006
Daniel W Cranston
exaly  

STRONG EDGE COLORING OF FIBONACCI AND LUCAS CUBES

Herald of Russian-Armenian (Slavonic) University humanities and social sciences, 2022
A. Drambyan, T. Petrosyan
openaire   +1 more source

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

Discrete Applied Mathematics, 2004
Mohammad R SalavatiPour
exaly  

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

Discrete Mathematics, 2016
Julien Bensmail, Aurélie Lagoutte
exaly