scholarly journals Minimum color‐degree perfect b ‐matchings

Networks ◽  
2020 ◽  
Author(s):  
Mariia Anapolska ◽  
Christina Büsing ◽  
Martin Comis ◽  
Tabea Krabs
Keyword(s):  
Color Degree

Color degree sum conditions for properly colored spanning trees in edge-colored graphs

2020 ◽  
Vol 343 (11) ◽  
pp. 112042
Author(s):  
Mikio Kano ◽  
Shun-ichi Maezawa ◽  
Katsuhiro Ota ◽  
Masao Tsugaki ◽  
Takamasa Yashima
Keyword(s):  
Spanning Trees ◽  
Degree Sum ◽  
Colored Graphs ◽  
Color Degree

scholarly journals Decomposing edge-colored graphs under color degree constraints

2017 ◽  
Vol 61 ◽  
pp. 491-497 ◽  
Author(s):  
Shinya Fujita ◽  
Ruonan Li ◽  
Guanghui Wang
Keyword(s):  
Colored Graphs ◽  
Color Degree

scholarly journals Flour mixture of rice flour, corn and cassava starch in the production of gluten-free white bread

2004 ◽  
Vol 47 (1) ◽  
pp. 63-70 ◽  
Author(s):  
Ana Cristina Ballesteros López ◽  
Accacia Julia Guimarães Pereira ◽  
Roberto Gonçalves Junqueira
Keyword(s):  
Specific Volume ◽  
Corn Starch ◽  
Rice Flour ◽  
Cassava Starch ◽  
Physical Parameters ◽  
White Bread ◽  
Production Parameters ◽  
Color Degree ◽  
Degree Of Satisfaction ◽  
Bread Production

The use of rice flour corn and cassava starch was evaluated in several formulations aiming to find a flour mixture to replace wheat flour in the production of free-gluten white bread. Production parameters were evaluated through sensory analysis. The resulting breads were evaluated taking into account physical parameters (crumb appearance, specific volume and moisture) and sensorial parameters (flavor, appearance, crumb texture, crust color and satisfaction). Regarding flavor and moisture, breads prepared with the three different ingredients were not statistically different at 5% probability by the Tuckey test. However, they differed significantly regarding the specific volume, crumb texture, crust color, degree of satisfaction and external appearance. Rice flour bread presented the best parameters, being preferred by the sensory evaluation panel, followed by corn starch bread and cassava starch bread. Breads prepared with rice flour resulted in a softer product, presenting a better consistency with small alveoli homogeneously distributed. As far as crumb texture was concerned, corn starch bread presented larger alveoli, while cassava starch resulted in bread with expandable and gummy crumb, with granulation without alveoli, and undesirable sensorial characteristics. Production parameters were established based on these results and a mixture of flours, composed by 45% rice flour, 35% corn starch and 20% cassava starch presented good results originating bread with crumb formed by uniform and well distributed cells, and pleasant flavor and appearance.

Experimental study of color degree of freedom of gluons ine+e−annihilation at √saround 60 GeV

1991 ◽  
Vol 66 (3) ◽  
pp. 280-284 ◽  
Author(s):  
K. Abe ◽  
K. Amako ◽  
Y. Arai ◽  
Y. Asano ◽  
M. Chiba ◽  
...  
Keyword(s):  
Experimental Study ◽  
Degree Of Freedom ◽  
Color Degree

Color Degree Condition for Long Rainbow Paths in Edge-Colored Graphs

2015 ◽  
Vol 39 (1) ◽  
pp. 409-425
Author(s):  
He Chen ◽  
Xueliang Li
Keyword(s):  
Degree Condition ◽  
Colored Graphs ◽  
Color Degree

scholarly journals Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition

10.37236/855 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Xueliang Li ◽  
Fengxia Liu
Keyword(s):  
Bipartite Graphs ◽  
Complete Multipartite Graph ◽  
Colored Graph ◽  
Degree Condition ◽  
Partition Number ◽  
Color Degree ◽  
Minimum Integer ◽  
Multipartite Graph ◽  
Complete Multipartite ◽  
Vertex Disjoint

The monochromatic tree partition number of an $r$-edge-colored graph $G$, denoted by $t_r(G)$, is the minimum integer $k$ such that whenever the edges of $G$ are colored with $r$ colors, the vertices of $G$ can be covered by at most $k$ vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2-edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exact value of $t_2(K(n_1,n_2,\cdots,n_k))$. In this paper, we prove that if $n\geq 3$, and $K(n,n)$ is 3-edge-colored such that every vertex has color degree 3, then $t_3(K(n,n))=3$.

scholarly journals Rainbow Matchings of size $m$ in Graphs with Total Color Degree at least $2mn$

10.37236/8239 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Jürgen Kritschgau
Keyword(s):  
Proper Coloring ◽  
Colored Graphs ◽  
Rainbow Matching ◽  
Color Degree ◽  
Host Graph

The existence of a rainbow matching given a minimum color degree, proper coloring, or triangle-free host graph has been studied extensively. This paper generalizes these problems to edge colored graphs with given total color degree. In particular, we find that if a graph $G$ has total color degree $2mn$ and satisfies some other properties, then $G$ contains a matching of size $m$. These other properties include $G$ being triangle-free, $C_4$-free, properly colored, or large enough. 

scholarly journals Rainbow Path and Color Degree in Edge Colored Graphs

10.37236/3770 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Anita Das ◽  
S. V. Subrahmanya ◽  
P. Suresh
Keyword(s):  
Short Proof ◽  
Maximum Length ◽  
Colored Graph ◽  
New Approach ◽  
Colored Graphs ◽  
Degree Of A Vertex ◽  
Color Degree ◽  
Rainbow Path

Let $G$ be an edge colored graph. A rainbow pathin $G$ is a path in which all the edges are colored with distinct colors. Let $d^c(v)$ be the color degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on the edges incident on the vertex $v$. Let $t$ be the maximum length of a rainbow path in $G$. Chen and Li (2005) showed that if $d^c \geq k \,\, (k\geq 8)$, for every vertex $v$ of $G$, then $t \geq \left \lceil \frac{3 k}{5}\right \rceil + 1$. Unfortunately, the proof by Chen and Li is very long and comes to about 23 pages in the journal version. Chen and Li states in their paper that it was conjectured by Akira Saito, that $t \ge \left \lceil \frac {2k} {3} \right \rceil$. They also state in their paper that they believe $t \ge k - c$ for some constant $c$. In this note, we give a short proof to show that $t \ge \left \lceil \frac{3 k}{5}\right \rceil$, using an entirely different method. Our proof is only about 2 pages long. The draw-back is that our bound is less by 1, than the bound given by Chen and Li. We hope that the new approach adopted in this paper would eventually lead to the settlement of the conjectures by Saito and/or Chen and Li.

scholarly journals Morphological characterization and hierarchical classification of 40 bush pea genotypes (Pisum sativum L.)

2021 ◽  
Vol 15 (2) ◽  
Author(s):  
Verónica Rosero-Lombana ◽  
Oscar Checa-Coral
Keyword(s):  
Multiple Correspondence Analysis ◽  
Hierarchical Classification ◽  
Principal Component ◽  
Morphological Characterization ◽  
The European Union ◽  
Color Degree ◽  
Qualitative Variables ◽  
Total Variability ◽  
New Varieties ◽  
Hierarchical Classification Analysis

The Universidad de Nariño is home to a collection of bush pea plantlets that are a source of biodiversity for the genetic improvement of pea species in Colombia. The characterization of these accessions is required to identify genotypes with attributes that could be used in the search for new varieties. For the morphological characterization, 40 pea accessions were planted in Pasto, Colombia. 23 quantitative variables and 12 qualitative variables were documented, descriptors proposed for this species by the European Union in 2003. The data were subjected to Principal Component Analysis and Multiple Correspondence Analysis. Finally, a hierarchical classification method was applied using Ward’s method. The first four components, which explained 78.80% of the total variability of the population, were selected for the quantitative variables. Four groups were identified. Genotypes with the afila gene, which are of interest for pea breeding programs, were found in groups 1 and 2. The highest seed weight was in group 1, and the genotypes with the best reaction to powdery mildew were in group four. For the qualitative variables, the first six factors, which described 60.51% of the variability, were selected, and the hierarchical classification analysis resulted in five groups. The qualitative characteristics that contributed more to the differentiation of the groups included leaflet type, hilum color, degree of curvature of the pod, color and shape of the grain.

Sign in / Sign up

Export Citation Format

Share Document