Results 51 to 60 of about 34,319 (321)
Regular inference as vertex coloring
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Costa Florêncio, C., Verwer, S.
openaire +4 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective The Gold Coast criteria permit diagnosis of amyotrophic lateral sclerosis (ALS) even without upper motor neuron (UMN) signs. However, whether ALS patients with UMN signs (ALSwUMN) and those without (ALSwoUMN) share similar characteristics and prognoses remains unclear.
Hee‐Jae Jung +7 more
wiley +1 more source
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
, 2014 We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a list of allowed colors for each vertex ...
Hatanaka, Tatsuhiko +2 more
core +1 more source
Advanced Functional Materials, EarlyView.Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +1 more source
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence [PDF]
, 2010 We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area.
Barenboim, Leonid, Elkin, Michael
core
The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs
Discussiones Mathematicae Graph Theory, 2017 A distinguishing coloring of a graph G is a coloring of the vertices so that every nontrivial automorphism of G maps some vertex to a vertex with a different color. The distinguishing number of G is the minimum k such that G has a distinguishing coloring
Immel Poppy, Wenger Paul S.
doaj +1 more source
Vertex colorings without rainbow subgraphs
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goddard Wayne, Xu Honghai
openaire +2 more sources
Advanced Functional Materials, EarlyView.HKUST‐1/TiO2 composite materials show a very high photocatalytic hydrogen evolution rate which increases as a function of the irradiation time until reaching a plateau and even surpasses the performance of the 1%Pt/TiO2 material after three photocatalytic cycles.
Alisha Khan +9 more
wiley +1 more source
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source