Results 41 to 50 of about 13,653 (313)
, 2013 We study the strength of $\RRT^3_2$, Rainbow Ramsey Theorem for colorings of triples, and prove that $\RCA + \RRT^3_2$ implies neither $\WKL$ nor $\RRT^4_2$.
Wang, Wei
core +1 more source
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
Desimal, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Afifah Farhanah Akadji +3 more
doaj +1 more source
Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there ...
Chartrand Gary +4 more
doaj +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
Hardness Results for Total Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2016 A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G ...
Chen Lily, Huo Bofeng, Ma Yingbin
doaj +1 more source
Rainbow-free 3-colorings in abelian groups [PDF]
Electronic Notes in Discrete Mathematics, 2009 A $3$-coloring of the elements of an abelian group is said to be rainbow-free if there is no $3$-term arithmetic progression with its members having pairwise distinct colors. We give a structural characterization of rainbow-free colorings of abelian groups. This characterization proves a conjecture of Jungić et al. on the size of the smallest chromatic
Montejano, Amanda, Serra Albó, Oriol
openaire +5 more sources
Theory and Applications of Graphs, 2022 Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors.
Shuhei Saitoh, Naoki Matsumoto, Wei Wu
doaj +1 more source
Generating Dynamic Structures Through Physics‐Based Sampling of Predicted Inter‐Residue Geometries
Advanced Science, EarlyView.While static structure prediction has been revolutionized, modeling protein dynamics remains elusive. trRosettaX2‐Dynamics is presented to address this challenge. This framework leverages a Transformer‐based network to predict inter‐residue geometric constraints, guiding conformation generation via physics‐based iterative sampling. The resulting method
Chenxiao Xiang +3 more
wiley +1 more source
Jambura Journal of Mathematics, 2022 Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa +5 more
doaj +1 more source