Results 31 to 40 of about 4,890 (237)
Strong Chromatic Index of Chordless Graphs [PDF]
Journal of Graph Theory, 2014 AbstractA strong edge coloring of a graph is an assignment of colors to the edges of the graph such that for every color, the set of edges that are given that color form an induced matching in the graph. The strong chromatic index of a graph G, denoted by , is the minimum number of colors needed in any strong edge coloring of G.
Manu Basavaraju, Mathew C. Francis
openalex +4 more sources
ON STRONG CHROMATIC INDEX OF SOME OPERATIONS ON GRAPHS [PDF]
Proceedings of the YSU A: Physical and Mathematical SciencesA strong edge-coloring of a graph $G$ is a mapping $\phi : E(G) \rightarrow \mathbb{N}$ such that the edges at distance $0$ or $1$ receive distinct colors. The minimum number of colors required for such a coloring is called the strong chromatic index of $G$ and is denoted by $\chi_s'(G)$.
A. Drambyan
openalex +3 more sources
From 3DGS scenes to plant traits: a scalable extraction and segmentation framework for muskmelon phenotyping [PDF]
Frontiers in Plant ScienceAutomated quantification of plant-level development from multi-plant greenhouse scenes requires separating individual plants from shared scene-level reconstructions and quantifying organ-level development, a challenge that single-plant acquisition ...
Jing-Heng Lin, Ta-Te Lin
doaj +2 more sources
Strong chromatic index of claw-free graphs with edge weight seven [PDF]
Discussiones Mathematicae Graph Theory, 2023 Yuquan Lin, Wensong Lin
doaj +2 more sources
The strong chromatic index of graphs and subdivisions
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kittikorn Nakprasit
exaly +2 more sources
On the strong chromatic index of cubic Halin graphs
Applied Mathematics Letters, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ko-Wei Lih, Daphne Der-Fen Liu
exaly +3 more sources
The strong chromatic index of $(3,Δ)$-bipartite graphs
Discret. Math., 2018 A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $Δ$. We show that every such graph has a strong edge-coloring using at most $3 Δ$ colors.
Mingfang Huang, Gexin Yu, Xiangqian Zhou
openalex +4 more sources
The strong chromatic index of Halin graphs
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsin-Hao Lai +2 more
openalex +3 more sources
The strong chromatic index of complete cubic Halin graphs
Applied Mathematics Letters, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wai Chee Shiu, Wing Ka Tam
exaly +2 more sources
The strong chromatic index of
, 2016 A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $\Delta$. We show that every such graph has a strong edge-coloring using at most $3 \Delta$ colors.
Mingfang Huang, Gexin Yu, Xiangqian Zhou
openalex +4 more sources