Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Colored”

colored

Michele Scagliola, O Pérez-gonzález, Pietro Guccione · 2010

Cited by 0

Colored

Digital Kenyon (Kenyon College) · 1916

Knights of Pythias Holding State Meeting In Delaware -- Mayor Welcomes Delegates. -- Delaware, July 26--The reception to the delegates at 8 o'clock at the city opera house was an interesting event of the day's activities in carrying out Tuesday's program for the join annual session of the Grand Lodge of Ohio, the Grand Court of Calanthe, and the Uniform Encampment of the colored K. of P.'s of Ohio, which opened here Monday, continuing until Thursday evening. Mayor A. J. White gave the address of welcome Monday evening, stating in his remarks that the city was open to the body, and that a hearty co-operation existed in Delaware. The welcome address for the lodge was given by Mr. T. M. Viney. Musical selections and numerous speeches by the delegates and grand lodge officers were served as a climaxing feature of the evening's reception.

Cited by 0Open access

Colored

Digital Kenyon (Kenyon College) · 1916

Knights of Pythias Holding State Meeting In Delaware -- Mayor Welcomes Delegates. -- Delaware, July 26--The reception to the delegates at 8 o'clock at the city opera house was an interesting event of the day's activities in carrying out Tuesday's program for the join annual session of the Grand Lodge of Ohio, the Grand Court of Calanthe, and the Uniform Encampment of the colored K. of P.'s of Ohio, which opened here Monday, continuing until Thursday evening. Mayor A. J. White gave the address of welcome Monday evening, stating in his remarks that the city was open to the body, and that a hearty co-operation existed in Delaware. The welcome address for the lodge was given by Mr. T. M. Viney. Musical selections and numerous speeches by the delegates and grand lodge officers were served as a climaxing feature of the evening's reception.

Cited by 0Open access

Colored

Bulletin of Miscellaneous Information (Royal Gardens Kew)

Cited by 0

Properly colored subgraphs in edge-colored graphs

Tingting Han · University of Twente Research Information · 2023

Properly colored cycles are closely related to directed cycles in directed graphs, and play an important role in molecular biology, transportation and communication, social sciences and other fields. In this thesis, we study the existence of properly colored cycles in edge-colored graphs and related cyclic properties, like the existence of properly colored cycles, cycle-factors and properly colored cycles of different or all lengths. The main results are as following.<br/><br/>We study the existence of short properly colored cycles in edge-colored complete graphs and edge-colored bipartite graphs. We give a sufficient condition for the existence of properly colored 4-cycles and characterize the extremal graphs. We also characterize the extremal graphs for several known results on the existence of properly colored triangles. Then we give sufficient conditions guaranteeing that every vertex is contained in a properly colored triangle and 4-cycle, respectively. Moreover, we obtain a sufficient condition for the existence of properly colored cycles of length at most 6 in edge-colored bipartite graphs.<br/><br/>By characterizing edge-colored complete graphs containing no PC odd cycles, we give an efficient algorithm for deciding the existence of PC odd cycles in an edge-colored complete graph. Moreover, we give an equivalent characterization of the existence of properly colored cycles of length k modulo m in edge-colored complete graphs.<br/><br/>We obtain sufficient conditions for the existence of k (vertex-disjoint) properly colored cycles of different lengths in edge-colored complete graphs.<br/><br/>We obtain a sufficient condition for the existence of properly colored cycle-factors in edge-colored bipartite graphs. Our result is a generalization of Lo's result on properly colored cycle-factors in edge-colored graphs in [SIAM J. Discrete Math. 28 (2014) 18--36].<br/><br/>We obtain a necessary and sufficient condition for edge-colored complete bipartite graphs containing no monochromatic paths of length three to be PC even vertex-pancyclic. Our result is a generalization of a result of Häggkvist and Manoussakis on bipartite tournaments in [Combinatorica 9 (1989) 33–38].

Cited by 0Open access

Maximum colored trees in edge-colored graphs

V. Borozan, W. Fernandez de La Vega, Y. Manoussakis, C. Martinhon, R. Muthu et al. · 2015

We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graph-theoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general and provide algorithms for graphs without properly edge-colored cycles. We also derive some nonapproximability bounds. A study of the trends random graphs display with regard to the presence of properly edge-colored spanning trees is presented.

Cited by 0

Properly colored cycles in edge-colored graphs

Ruonan Li · 2017

An edge-colored graph is a graph with each edge assigned a color. A properly colored cycle ( or PC cycle for short ) is a cycle such that consecutive edges are assigned distinct colors. Properly colored cycles have attracted much attention during the past decades, not only because of many interesting conjectures and results on this specifics topic, but also for the fact that studying PC cycles in edge-colored graphs generalizes the study of cycles in directed graphs. PC cycles have also appeared in applications, e.g. in social science and molecular biology. In this thesis, we are interested in theoretical aspects only.The first three chapters of this thesis study short or long PC cycles in edge-colored graphs, complete graphs and complete bipartite graphs. In Chapter 2, a color degree sum condition for pairs of adjacent vertices are given for the existence of PC triangles in edge-colored graphs. In Chapter 3, we characterize the structure of an edge-colored complete bipartite graphs without containing a PC cycle of length 4. Based on this characterization, we give a minimum color degree condition and a maximum monochromatic degree condition for an edge-colored complete bipartite graph to contain a PC cycle of length 4, and for PC cycles of length 4 passing through a given vertex or edge, respectively. In Chapter 4, a PC cycle extension result is obtained, which relates to a Conjecture given by Fujita and Magnant.Works in the last three chapters are motivated by and dedicated to the close relationship between PC cycles in edge-colored graphs and directed cycles in directed graphs. In particular, the results in Chapters 5 and 6 are related to a conjecture on disjoint cycles in directed graphs due to Bermond and Thomassen. In Chapter 7, we aim to study the difference between edge-colored graphs and directed graphs, and find that the class of PC theta graphs plays an important role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also give color number condition and minimum color degree condition for the existence of small and large PC theta graphs, respectively.Throughout this thesis, we have investigated the existence of many types of PC cycles and other PC subgraphs ( e.g. PC theta graphs) related to PC cycles under different conditions. Despite our new contributions, many problems and conjectures remain unresolved. We also leave several new open questions and posed a number of new conjectures to stimulate further research. We hope that this will attract the attention of many researchers and spur the developments in this exciting area.

Cited by 1Open access

[Four colored peelers on a colored backdrop]

Williams, Byrd M. (Byrd Moore), IV, 1951- · The Portal to Texas History (University of North Texas)

Photograph of four vegetable peelers. They have multicolored handles. They are being photographed in front of a blue background.

Cited by 0

Colored Monopoles

Yong-Hyun Cho · Physical Review Letters · 1980

of our system to the second harmonic is twice the sensitivity to the first one.If our data were affected by the average error bar of Smoot, Gorenstein, and Muller, we would have derived a pure dipole fitting with y2 = 18 for 21 data points, in good agreement with the Berkeley and Princeton experiments.

Cited by 2Open access