19 citations · 30 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Unique colorability and clique minors
Matthias Kriesell
For a graph G, let h(G) denote the largest k such that G has k pairwise disjoint pairwise adjacent connected nonempty subgraphs, and let s(G) denote the largest k such that G has k…
math.CO2015
Maximal ambiguously k-colorable graphs
Matthias Kriesell
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-…