Results 111 to 120 of about 12,413 (296)
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
Ars Mathematica Contemporanea, 2015 An edge coloring of a graph G is said to be an odd edge coloring if for each vertex v ofG and each colorc, the vertexv uses the colorc an odd number of times or does not use it at all. In [5], Pyber proved that 4 colors suffice for an odd edge coloring of any simple graph.
Borut Luzar +2 more
openaire +3 more sources
Faster Edge Coloring by Partition Sieving [PDF]
In the Edge Coloring problem, we are given an undirected graph G with n vertices and m edges, and are tasked with finding the smallest positive integer k so that the edges of G can be assigned k colors in such a way that no two edges incident to the same
Koana, Tomohiro, Akmal, Shyan
core +1 more source
FEBS Open Bio, EarlyView.CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +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
Parsimonious edge-coloring on surfaces
Electronic Journal of Graph Theory and Applications, 2018 We correct a small error in a 1996 paper of Albertson and Haas, and extend their lower bound for the fraction of properly colorable edges of planar subcubic graphs that are simple, connected, bridgeless, and edge-maximal to other surface embeddings of ...
Sarah-Marie Belcastro
doaj +1 more source
FEBS Open Bio, EarlyView.Enzymes of the 2‐hydroxyacyl‐CoA lyase group catalyze the condensation of formyl‐CoA with aldehydes or ketones. Thus, by structural adaptation of active sites, practically any pharmaceutically and industrially important 2‐hydroxyacid could be biotechnologically synthesized. Combining crystal structure analysis, active site mutations and kinetic assays,
Michael Zahn +4 more
wiley +1 more source
Distributed Edge Coloring and Locally Sparse Graph Coloring
, 2014 Graph coloring is a central problem in distributed computing. In this work, we study both the edge coloring and vertex coloring problems. For constant ɛ> 0, we give a distributed algorithm for (1 + ɛ)∆-edge coloring running in O(log ∗ log n ∆ · max(1,
Hsin-hao Su, Seth Pettie, Michael Elkin
core
Approximation Algorithms for Distance-2 Edge Coloring [PDF]
, 2002 The authors consider the link scheduling problem for packet radio networks which is assigning channels to the connecting links so that transmission may proceed on all links assigned the same channel simultaneously without collisions.
Marathe, Madhav +4 more
core