Results 61 to 70 of about 14,669 (262)

Star edge coloring of $ K_{2, t} $-free planar graphs

open access: yesAIMS Mathematics, 2023
The star chromatic index of a graph $ G $, denoted by $ \chi{'}_{st}(G) $, is the smallest number of colors required to properly color $ E(G) $ such that every connected bicolored subgraph is a path with no more than three edges.
Yunfeng Tang , Huixin Yin , Miaomiao Han
doaj   +1 more source

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching

open access: yes, 2017
We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds.
Fischer, Manuela   +2 more
core   +1 more source

Interplay between circadian and other transcription factors—Implications for cycling transcriptome reprogramming

open access: yesFEBS Letters, EarlyView.
This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley   +1 more source

Acyclicity in edge-colored graphs [PDF]

open access: yesDiscrete Mathematics, 2017
A walk $W$ in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in $W$ is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type $i$ is a proper superset of graphs of acyclicity of type $i+1$, $i=1,2,3,4.$ The first three types are ...
Gutin, Gregory   +4 more
openaire   +2 more sources

Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing

open access: yesFEBS Letters, EarlyView.
Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley   +1 more source

A note on compact and compact circular edge-colorings of graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj  

Acyclic edge coloring of planar graphs

open access: yesAIMS Mathematics, 2022
An acyclic edge coloring of a graph $ G $ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of $ G $, denoted by $ \chi^{'}_{a}(G) $, is the smallest integer $ k $ such that $ G $ is acyclically edge $ k $
Yuehua Bu   +3 more
doaj   +1 more source

Substrate specificity of Burkholderia pseudomallei multidrug transporters is influenced by the hydrophilic patch in the substrate‐binding pocket

open access: yesFEBS Letters, EarlyView.
Multidrug transporters BpeB and BpeF from the Gram‐negative pathogen Burkholderia pseudomallei have a hydrophilic patch in their substrate‐binding pocket. Drug susceptibility tests and growth curve analyses using an Escherichia coli recombinant expression system revealed that the hydrophilic patches of BpeB and BpeF are involved in the substrate ...
Ui Okada, Satoshi Murakami
wiley   +1 more source

M2-Edge Colorings Of Cacti And Graph Joins

open access: yesDiscussiones Mathematicae Graph Theory, 2016
An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G.
Czap Július   +2 more
doaj   +1 more source

On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2019
Let  be a nontrivial and connected graph of vertex set  and edge set  . A bijection  is called a local edge antimagic labeling if for any two adjacent edges  and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy