Results 71 to 80 of about 33,621 (316)
A Min-Max theorem about the Road Coloring Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The Road Coloring Conjecture is an old and classical conjecture e posed in Adler and Weiss (1970); Adler et al. (1977). Let $G$ be a strongly connected digraph with uniform out-degree $2$.
Rajneesh Hegde, Kamal Jain
doaj +1 more source
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights [PDF]
, 2013 Let $G$ be a graph and $\mathcal {S}$ be a subset of $Z$. A vertex-coloring $\mathcal {S}$-edge-weighting of $G$ is an assignment of weight $s$ by the elements of $\mathcal {S}$ to each edge of $G$ so that adjacent vertices have different sums of ...
Lu, Hongliang
core
Harnessing Outer Space for Improved Electrocaloric Cooling
Advanced Functional Materials, EarlyView.A novel radiative heat sink/source‐integrated electrocaloric (R‐iEC) system combines the electrocaloric (EC) effect with a thermally conductive radiative cooler (TCRC) to address heat dissipation limitations in EC devices. Utilizing outer space as a heat sink, the system achieves up to 240 W m−2 of heat dissipation performance, making it highly ...
Dong Hyun Seo +8 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
Data Reduction for Graph Coloring Problems
, 2013 This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring
Bart M.P. Jansen +30 more
core +1 more source
Advanced Functional Materials, EarlyView.The MPTT‐nanozyme‐hydrogel system (Mn3O4@ChS‐HA) provides a multifunctional therapeutic strategy for intervertebral disc degeneration (IVDD), effectively targeting oxidative stress and enhancing AF repair by restoring extracellular matrix (ECM) and redox homeostasis.
Yangyang Chen +13 more
wiley +1 more source
Game Chromatic Number of Tadpole Graph, Broom Graph, and Tribune Graph
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph coloring game is one of application in graph theory. The goal in this article is determine game chromatic number of tadpole graph, broom graph, and tribune graph.
Fransiskus Fran, M Luthfi Abdurahman
doaj +1 more source
On vertex b-critical trees [PDF]
Opuscula Mathematica, 2013 A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors.
Mostafa Blidia +2 more
doaj +1 more source
On the Total Set Chromatic Number of Graphs
Theory and Applications of Graphs, 2022 Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets.
Mark Anthony C. Tolentino +2 more
doaj +1 more source