Karen L. Collins

activity

20002026

most citedNordhaus-Gaddum Theorem for the Distinguishing Chromatic Number

3 citations · 7 across the 16 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

math.CO2012

Constructing graphs with no immersion of large complete graphs

Karen L. Collins, Megan E. Heenehan

In 1989, Lescure and Meyniel proved, for $d = 5, 6$ , that every $d$ -chromatic graph contains an immersion of $K_{d}$ , and in 2003 Abu-Khzam and Langston conjectured that this holds for…

math.CO2012★ 3 cited

Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number

Karen L. Collins, Ann Trenk

Nordhaus and Gaddum proved, for any graph G, that the chromatic number of G plus the chromatic number of G complement is less than or equal to the number of vertices in G plus 1. F…