Maximal ambiguously k-colorable graphs
Combinatorics
2016-06-28 v2
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 maximally ambiguously k-colorable graphs in terms of quadratic matrices. As an application, we calculate the maximum number of edges an ambiguously k-colorable graph can have, and characterize the extremal graphs.
Cite
@article{arxiv.1502.03555,
title = {Maximal ambiguously k-colorable graphs},
author = {Matthias Kriesell},
journal= {arXiv preprint arXiv:1502.03555},
year = {2016}
}