Results 11 to 20 of about 4,847 (217)
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
The strong chromatic index of graphs and subdivisions
Discrete Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keaitsuda Nakprasit, 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 Complete Halin Graphs
MathematicsThe strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G),
Zhiwei Bi, Yunfang Tang
doaj +2 more sources
Bounding the strong chromatic index of dense random graphs
Discrete Mathematics, 2004 For a finite simple graph \(G\), a strong edge colouring of \(G\) is an edge colouring in which every colour class is an induced matching. (Since each class is a matching, the colouring is proper.) The strong chromatic index of \(G\), \(\chi_{s}(G)\), is the smallest number of colours in a strong edge colouring of \(G\).
Andrzej Czygrinow, Brendan Nagle
exaly +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
Strong chromatic index and Hadwiger number [PDF]
Journal of Graph Theory, 2021 AbstractWe investigate the effect of a fixed forbidden clique minor upon the strong chromatic index, both in multigraphs and in simple graphs. We conjecture for each that any ‐minor‐free multigraph of maximum degree has strong chromatic index at most . We present a construction certifying that if true the conjecture is asymptotically sharp as .
Wouter Cames van Batenburg +3 more
openaire +4 more sources
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
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
openaire +3 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source