Results 231 to 240 of about 41,117 (251)
Parity and strong parity edge-colorings of graphs [PDF]
Journal of Combinatorial Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsiang-Chun Hsu, Gerard J. Chang
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On (s, t)-relaxed strong edge-coloring of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wensong Lin, Lin Wensong
exaly +3 more sources
Strong Edge-Coloring of Pseudo-Halin Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li, Li Xiangwen
exaly +2 more sources
On strong edge-coloring of graphs with maximum degree 5
Discrete Applied MathematicsA strong edge-coloring of a simple finite graph \(G = (V(G),E(G))\) is a proper edge coloring of \(G\) such that any two edges of distance at most \(2\) receive distinct colors. This is the same as saying that any two vertices in the corresponding line graph \(L(G)\) of \(G\) of distance of at most \(2\) must receive distinct colors.
Huiqing Liu, Jian Lu
exaly +2 more sources
Strong edge coloring of circle graphs
European Journal of Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Debski +1 more
openaire +2 more sources
A polynomial time algorithm for strong edge coloring of partial k-trees [PDF]
Discrete Applied Mathematics, 2004 A matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to find an edge coloring of a given graph with minimum number of colors such that each color class is an induced ...
Mohammad Salavatipour
exaly +2 more sources
d-strong Edge Colorings of Graphs
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arnfried Kemnitz, Massimiliano Marangio
openaire +2 more sources
Strong edge-coloring of graphs with maximum degree 4 using 22 colors [PDF]
Discrete Mathematics, 2006 In 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is bounded above by 54Δ2 when Δ is even and 14(5Δ2-2Δ+1) when Δ is odd. They gave a simple construction which requires this many colors.
Daniel Cranston
exaly +2 more sources
On Strong Edge-Coloring of Claw-Free Subcubic Graphs
Graphs and Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang
openaire +1 more source
Strong edge-colorings of planar graphs with small girth
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yirong Guo +2 more
openaire +2 more sources