Results 31 to 40 of about 5,252 (152)

Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs

Discussiones Mathematicae Graph Theory, 2013
We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40+1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.
Borodin Oleg V., Ivanova Anna O.
doaj   +1 more source

Incidence and strong edge colorings of graphs

Discrete Mathematics, 1993
The incidence coloring number of a graph is defined and bounded in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. A bound for the strong chromatic index of bipartite graphs all of whose cycle lengths are divisible by 4 is improved.
Richard A. Brualdi, Jennifer J. Quinn Massey   +1 more
openaire   +1 more source

Upper Bounds for the Strong Chromatic Index of Halin Graphs

Discussiones Mathematicae Graph Theory, 2018
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2.
Hu Ziyu, Lih Ko-Wei, Liu Daphne Der-Fen
doaj   +1 more source

Color code techniques in rainbow connection

Electronic Journal of Graph Theory and Applications, 2018
Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj   +1 more source

Strong Edge Coloring of Cayley Graphs and Some Product Graphs

, 2022
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 required is termed the strong chromatic index.
Tuza, Zsolt, Narayanan, Narayanan, Dara, Suresh, Mishra, Suchismita   +3 more
core   +1 more source

An Introduction to Fuzzy Edge Coloring [PDF]

, 2016
In this paper, a new concept of fuzzy edge coloring is introduced. The fuzzy edge coloring is an assignment of colors to edges of a fuzzy graph G. It is proper if no two strong adjacent edges of G will receive the same color.
K.S, Kanzul Fathima, Hussain R, Jahir
core   +1 more source

On the approximability of the maximum induced matching problem [PDF]

, 2005
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele, David F. Manlovey, Zito, M., M. Zito, D. Manlove, Michele Zitoz, Duckworth, William, Manlove, D.F., W. Duckworth, Manlove, David F., Duckworth, W., William Duckworth, Manlove, David F   +12 more
core   +1 more source

Optimal strong parity edge-coloring of complete graphs [PDF]

Combinatorica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu   +3 more
openaire   +1 more source

Sliding window temporal graph coloring [PDF]

, 2021
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching.
Mertzios, George B, Zamaraev, Viktor, Molter, Hendrik, Molter, H., Mertzios, G.B., Zamaraev, V.   +5 more
core   +1 more source

Strong parity edge-colorings of graphs

European Journal of Combinatorics
17 ...
Peter Bradshaw, Sergey Norin, Douglas B. West   +2 more
openaire   +2 more sources