Welcome to Anagrammer Crossword Genius! Keep reading below to see if subcolon is an answer to any crossword puzzle or word game (Scrabble, Words With Friends etc). Scroll down to see all the info we have compiled on subcolon.
subcolon
Searching in Crosswords ...
The answer SUBCOLON has 0 possible clue(s) in existing crosswords.
Searching in Word Games ...
The word SUBCOLON is NOT valid in any word game. (Sorry, you cannot play SUBCOLON in Scrabble, Words With Friends etc)
There are 8 letters in SUBCOLON ( B3C3L1N1O1S1U1 )
To search all scrabble anagrams of SUBCOLON, to go: SUBCOLON?
Rearrange the letters in SUBCOLON and see some winning combinations
Scrabble results that can be created with an extra letter added to SUBCOLON
5 letters out of SUBCOLON
4 letters out of SUBCOLON
3 letters out of SUBCOLON
Searching in Dictionaries ...
Definitions of subcolon in various dictionaries:
No definitions found
Word Research / Anagrams and more ...
Keep reading for additional results and analysis below.
Subcolon might refer to |
---|
In graph theory, a subcoloring is an assignment of colors to a graph's vertices such that each color class induces a vertex disjoint union of cliques. That is, each color class should form a cluster graph. * A subchromatic number χS(G) of a graph G is the least number of colors needed in any subcoloring of G. * Subcoloring and subchromatic number were introduced by Albertson et al. (1989). * Every proper coloring and cocoloring of a graph are also subcolorings, so the subchromatic number of any graph is at most equal to the cochromatic number, which is at most equal to the chromatic number. * Subcoloring is as difficult to solve exactly as coloring, in the sense that (like coloring) it is NP-complete. More specifically, * the problem of determining whether a planar graph has subchromatic number at most 2 is NP-complete, even if it is a* triangle-free graph with maximum degree 4 (Gimbel & Hartman 2003) (Fiala et al. 2003), * comparability graph with maximum degree 4 (Ochem 2017), * line graph of a bipartite graph with maximum degree 4 (Gonçalves & Ochem 2009), * graph with girth 5 (Montassier & Ochem 2015).The subchromatic number of a cograph can be computed in polynomial time (Fiala et al. 2003). For every fixed integer r, it is possible to decide in polynomial time whether the subchromatic number of interval and permutation graphs is at most r (Broersma et al. 2002). |