Search
Search Results
-
Strong Edge Coloring of Outerplane Graphs with Independent Crossings
The strong chromatic index of a graph is the minimum number of colors needed in a proper edge coloring so that no edge is adjacent to two edges of...
-
A note on strong edge-coloring of claw-free cubic graphs
A strong edge-coloring of a graph G is an edge-coloring of G such that any two edges that are either adjacent to each other or adjacent to a common...
-
On Strong Edge-Coloring of Claw-Free Subcubic Graphs
A strong edge-coloring of a graph G is a proper edge coloring such that every path of length 3 uses three different colors. The strong chromatic...
-
Injective edge-coloring of claw-free subcubic graphs
An injective edge-coloring of a graph G is an edge-coloring of G such that any two edges that are at distance 2 or in a common triangle receive...
-
Strong Edge Coloring of Cayley Graphs and Some Product Graphs
A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors...
-
-
-
-
-
-
Incidence Coloring of Outer-1-planar Graphs
A graph is outer-1-planar if it can be drawn in the plane so that all vertices lie on the outer-face and each edge crosses at most one another edge....
-
Application of soft sets to graph coloring
Zadeh’s fuzzy set maybe considered as a special case of the soft sets. Soft sets proposed by Molodtsov in 1999 to address uncertainty in a parametric...
-
Strongly Proper Connected Coloring of Graphs
We study a new variant of connected coloring of graphs based on the concept of strong edge coloring (every color class forms an induced matching). In...
-
Strong Edge Geodetic Problem on Complete Multipartite Graphs and Some Extremal Graphs for the Problem
A set of vertices X of a graph G is a strong edge geodetic set if, to any pair of vertices from X , we can assign one (or zero) shortest path between...
-
Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs Without 4-Cycles
The adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that the edge coloring set on any pair of adjacent...
-
Absence of zeros implies strong spatial mixing
In this paper we show that absence of complex zeros of the partition function of the hard-core model on any family of bounded degree graphs that is...
-
Strong Edge-Coloring of Pseudo-Halin Graphs
A strong edge-coloring of a graph G is a proper edge-coloring such that every path of length 3 uses three different colors. The strong chromatic index ...
-
On the Alon–Tarsi number of semi-strong product of graphs
The Alon–Tarsi number was defined by Jensen and Toft (Graph coloring problems, Wiley, New York, 1995). The Alon–Tarsi number AT ( G ) of a graph G is...
-
