Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,566,250 papers from all fields of science
Search
Sign In
Create Free Account
Strong coloring
Known as:
Chromatic (disambiguation)
, Strong chromatic number
In graph theory, a strong coloring, with respect to a partition of the vertices into (disjoint) subsets of equal sizes, is a (proper) vertex coloring…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Combinatorics, Probability and Computing
Edge coloring
Graph theory
Penny Haxell
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Special Guards in Chromatic Art Gallery
Hamid Hoorfar
,
Ali Mohades
arXiv.org
2017
Corpus ID: 13877377
We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well…
Expand
2017
2017
The Strong Colors of Flowers - The Structure of Graphs with Chordal Squares
Sebastian Wiederrecht
2017
Corpus ID: 119263600
A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not…
Expand
2016
2016
COLORING OF BIFUZZY GRAPHS
Sundas Shahzadi
2016
Corpus ID: 4648648
In this paper, we introduce coloring function of a bifuzzy edge graph G = (V, B) using (α, β)-cuts of G and determine the…
Expand
2015
2015
STRONG CHROMATIC NUMBER OF RESULTANT OF FUZZY GRAPHS
Anjaly Kishore
,
M. S. Sunitha
2015
Corpus ID: 123501216
G raph coloring techniques are used to solve many practical problems involving networks. Coloring of fuzzy graphs also plays a…
Expand
2011
2011
(k,r) - Semi Strong Chromatic Number of a Graph
G. Jothilakshmi
,
A. Pushpalatha
,
S. Suganthi
,
V. Swaminathan
2011
Corpus ID: 8536439
-semi strong chromatic number of G and it is denoted by (G). The number (G) is determined for various known graphs and some…
Expand
2009
2009
A COLORING THEOREM FOR SUCCESSORS OF SINGULAR CARDINALS
Todd Eisworth
2009
Corpus ID: 26641833
We formulate and prove (in ZFC) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer…
Expand
2009
2009
A coloring theorem for succesors of singular cardinal
Todd Eisworth
2009
Corpus ID: 115173101
We formulate and prove (in {\sf ZFC}) a strong coloring theorem which holds at successors of singular cardinals, and use it to…
Expand
2005
2005
Factors of r-partite graphs
A. Johansson
,
R. Johansson
,
K. Markström
2005
Corpus ID: 17894826
We give sufficient conditions for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This…
Expand
2002
2002
On the strong coloring of graphs
Zhang Zhong-fu
2002
Corpus ID: 123796916
The upper boundary and the extremal graph properties of the strong chromatic number χ s(G) of a simple graph G(V,E)are studied…
Expand
1995
1995
Semi strong chromatic number of a graph
E. Sampathkumar
,
L. Pushpalatha
1995
Corpus ID: 118943389
The `semi-strong chromatic number' chi(s)(G) of a graph G is the minimum order of a partition L of V(G) such that every set S in…
Expand