Results 21 to 30 of about 91,208 (231)

Edge Cover Through Edge Coloring

The Electronic Journal of Combinatorics
Let $G$ be a multigraph. A subset $F$ of $E(G)$ is an edge cover of $G$ if every vertex of $G$ is incident to an edge of $F$. The cover index, $\xi(G)$, is the largest number of edge covers into which the edges of $G$ can be partitioned. Clearly $\xi(G) \le \delta(G)$, the minimum degree of $G$.
Chen, Guantao, Shan, Songling
openaire   +1 more source

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems [PDF]

Journal of Parallel and Distributed Computing, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang, Weifa, Shen, Xiaojun, Hu, Qing
openaire   +2 more sources

Edge homogeneous colorings

Opuscula Mathematica, 2022
We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) \(q\) colors (resp.
Tomáš Madaras, Alfréd Onderko, Thomas Schweser   +2 more
openaire   +1 more source

Improved Edge-Coloring with Three Colors

Theoretical Computer Science, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Vertex-Coloring 2-Edge-Weighting of Graphs [PDF]

, 2010
A $k$-{\it edge-weighting} $w$ of a graph $G$ is an assignment of an integer weight, $w(e)\in \{1,\dots, k\}$, to each edge $e$. An edge weighting naturally induces a vertex coloring $c$ by defining $c(u)=\sum_{u\sim e} w(e)$ for every $u \in V(G)$. A $k$
Lu, Hongliang, Yu, Qinglin, Zhang, Cun-Quan   +2 more
core  

Symmetric colorings of polypolyhedra

, 2015
Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami models with one ...
Belcastro, Sarah-Marie, Hull, Thomas C.
core   +1 more source

Molecular bases of circadian magnesium rhythms across eukaryotes

FEBS Letters, EarlyView.
Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley   +1 more source

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

FEBS 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

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 Complexity of Distributed Edge Coloring with Small Palettes

, 2018
The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree $\Delta$. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1.
Chang, Yi-Jun, He, Qizheng, Li, Wenzheng, Pettie, Seth, Uitto, Jara   +4 more
core   +1 more source