Results 61 to 70 of about 34,319 (321)
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
Advanced Functional Materials, EarlyView.By a simple anti‐Galvanic reaction, up to six copper atoms could be preferably doped into the Ag2(SR)5 staple motifs and Ag20 dodecahedral shell of an atomically precise Ag44(SR)30 nanocluster. When anatase TiO2 is used as substrate, the (AgCu)44/TiO2 photocatalyst exhibited much improved activity in photocatalytic CO2 reduction compared to Ag44/TiO2 ...
Ye Liu +5 more
wiley +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
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
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
Reconfigurable Three‐Dimensional Superconducting Nanoarchitectures
Advanced Functional Materials, EarlyView.3D superconducting nanostructures offer new possibilities for emergent physical phenomena. However, fabricating complex geometries remains challenging. Here 3D nanoprinting of complex 3D superconducting nanoarchitectures is established. As well as propagating superconducting vortices in 3D, anisotropic superconducting properties with geometric ...
Elina Zhakina +11 more
wiley +1 more source
Spotting Trees with Few Leaves
, 2015 We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10].
A Björklund +26 more
core +1 more source
Modular Coloring and Switching in Some Planar Graphs
Ratio Mathematica, 2023 For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
doaj +1 more source
A survey on vertex coloring problems [PDF]
International Transactions in Operational Research, 2009 AbstractThis paper surveys the most important algorithmic and computational results on the Vertex Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the classical models for the VCP, and discusses how these models can be used and possibly strengthened to derive exact and heuristic algorithms for the problem ...
MALAGUTI, ENRICO, TOTH, PAOLO
openaire +2 more sources
Double Helical Plasmonic Antennas
Advanced Functional Materials, EarlyView.Plasmonic double helical antennas funnel circularly polarized light to the nanoscale, offering strong chiroptical interaction and directional light emission. Extending a single helix design tool, this study combines numerical modeling with experimental validation, revealing large, broadband dissymmetry factors in the visible range.
Aleksei Tsarapkin +7 more
wiley +1 more source