Results 11 to 20 of about 60,707 (240)
On the computational complexity of strong edge coloring
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Odd graph and its applications to the strong edge coloring [PDF]
Applied Mathematics and Computation, 2018 A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index $χ_s'(G)$ of a graph $G$ is the minimum number of colors in a strong edge coloring of $G$. Let $Δ\geq 4$ be an integer. In this note, we study the odd graphs and show the existence of some special walks.
Tao Wang
exaly +4 more sources
Strong edge-coloring for cubic Halin graphs
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gérard J Chang, Daphne Der-Fen Liu
exaly +4 more sources
The strong 3-rainbow index of some certain graphs and its amalgamation [PDF]
Opuscula Mathematica, 2022 We introduce a strong \(k\)-rainbow index of graphs as modification of well-known \(k\)-rainbow index of graphs. A tree in an edge-colored connected graph \(G\), where adjacent edge may be colored the same, is a rainbow tree if all of its edges have ...
Zata Yumni Awanis, A.N.M. Salman
doaj +1 more source
Strong Edge Coloring of K4(t)-Minor Free Graphs
Axioms, 2023 A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Huixin Yin, Miaomiao Han, Murong Xu
doaj +1 more source
Grünbaum colorings extended to non-facial 3-cycles
Electronic Journal of Graph Theory and Applications, 2022 We consider the question of when a triangulation with a Grünbaum coloring can be edge-colored with three colors such that the non-facial 3-cycles also receive all three colors; we will call this a strong Grünbaum coloring.
sarah-marie belcastro, Ruth Haas
doaj +1 more source
From Edge-Coloring to Strong Edge-Coloring [PDF]
The Electronic Journal of Combinatorics, 2015 In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin +6 more
openaire +3 more sources
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
Exact square coloring of graphs resulting from some graph operations and products
AKCE International Journal of Graphs and Combinatorics, 2022 A vertex coloring of a graph [Formula: see text] is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors.
Priyamvada, B. S. Panda
doaj +1 more source
Local strong rainbow connection number of corona product between cycle graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj +1 more source