Add time:07/26/2019         Source:sciencedirect.com

A graph is ambiguously k-colorable if its vertex set admits two distinct partitions each into at most k anticliques. We give a full characterization of the maximal ambiguously k-colorable graphs in terms of k×k-matrices. As an application, we calculate the maximum number of edges an ambiguously k-colorable graph can have, and characterize the extremal graphs.

We also recommend Trading Suppliers and Manufacturers of Color (cas 10-83-3). Pls Click Website Link as below: cas 10-83-3 suppliers