Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
