1 paper
Laurent Beaudou, Penny Haxell, Kathryn Nurse +2
We say that a signed graph is k-critical if it is not k-colorable but every one of its proper subgraphs is k-colorable. Using the definition of colorability due to Naserasr,…