Results 31 to 40 of about 1,131,712 (268)
The oriented chromatic number of edge-amalgamation of cycle graph
Indonesian Journal of Combinatorics, 2019 An oriented k − coloring of an oriented graph G⃗ is a partition of V(G⃗) into k color classes such that no two adjacent vertices belong to the same color class, and all the arcs linking the two color classes have the same direction.
Dina Eka Nurvazly +2 more
doaj +1 more source
, 2013 International audienceColoring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of k > 0 colors. Each different ruleset specifies that game's coloring constraints.
Beaulieu, Gabriel +2 more
core +6 more sources
Coloring count cones of planar graphs [PDF]
, 2022 For a plane near‐triangulation G with the outer face bounded by a cycle C, let nG⋆ denote the function that to each 4‐coloring ψ of C assigns the number of ways ψ extends to a 4‐coloring of G.
Lidicky, Bernard, Dvořák, Zdeněk
core
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
Degree-constrained edge partitioning in graphs arising from discrete tomography
Journal of Graph Algorithms and Applications, 2009 Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open.
Cedric Bentz +4 more
doaj +1 more source
Orientation-contingent color aftereffects are determined by real color, not induced color [PDF]
Perception & Psychophysics, 1988 Three experiments were concerned with whether orientation-contingent color aftereffects (McCollough effects) occur when the perceived colors of differently oriented gratings derive from colored shadows, a compelling instance of simultaneous color contrast.
W R, Webster, R H, Day, K, Willenberg
openaire +2 more sources
Extensions of Vizing fans and Vizing's Theorem in graph edge coloring [PDF]
, 2022 Graph edge coloring is a well established subject in the field of graph theory. It is one of the basic combinatorial optimization problem: Color the edges of a graph $G$ with as few colors as possible such that each edge receives a color and adjacent ...
Qi, Xuli
core +1 more source
Oriented Total-Coloring of Oriented Graphs
, 2022 A proper $n$-coloring of a graph $G$ is an assignment of colors from $\{1,\ldots,n\}$ to its vertices such that no two adjacent vertices get assigned the same color. The chromatic number of $G$, denoted by $\chi(G)$, refers to the smallest $n$ such that $
Nandy, Ayan +6 more
core
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core