Abstract
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 language | English |
|---|---|
| Pages (from-to) | 155-164 |
| Number of pages | 10 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Volume | 14 |
| Issue number | 2 |
| Publication status | Published - 2012 |
| Externally published | Yes |