Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,399,063 papers from all fields of science
Search
Sign In
Create Free Account
Subcoloring
Known as:
Subchromatic number
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Clique (graph theory)
Cocoloring
Cograph
Color
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A $(5,5)$-coloring of $K_n$ with few colors
A. Cameron
,
Emily Heath
2017
Corpus ID: 119640288
For fixed integers $p$ and $q$, let $f(n,p,q)$ denote the minimum number of colors needed to color all of the edges of the…
Expand