Home » Keyword index

immersion


Graph Theory » Coloring » Vertex coloring

Coloring and immersion ★★★

Author(s): Abu-Khzam; Langston

Conjecture   For every positive integer $ t $, every (loopless) graph $ G $ with $ \chi(G) \ge t $ immerses $ K_t $.

Keywords: coloring; complete graph; immersion

Posted by mdevos
updated September 4th, 2007
add new comment
Syndicate content