The following pages link to Chromatic partitions of a graph (Q1263595):
Displaying 15 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- A sequential coloring algorithm for finite sets (Q1297462) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- A chromatic partition polynomial (Q1381837) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Partitioning and coloring graphs with degree constraints (Q1947012) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- (Q3490030) (← links)
- The chromatic number of extended odd graphs is four (Q3819086) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- (Q5076839) (← links)
- On the chromatic coefficients of graphs with dense neighborhoods. (Q5314020) (← links)
- (Q5874562) (← links)
