Immersion containment and connectivity in color-critical graphs

Faisal Abu Khzam, M Langston

Research output: Contribution to journalArticlepeer-review


The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. It is shown that a t-chromatic graph G contains either an immersed Kt or an immersed t-chromatic subgraph that is both 4-vertex-connected and t-edge-connected. This gives supporting evidence of our conjecture that if G requires at least t colors, then Kt is immersed in G.
Original languageEnglish
Pages (from-to)155-164
Number of pages10
JournalDiscrete Mathematics and Theoretical Computer Science
Issue number2
Publication statusPublished - 2012
Externally publishedYes


Dive into the research topics of 'Immersion containment and connectivity in color-critical graphs'. Together they form a unique fingerprint.

Cite this