Complete graph immersions in dense graphs

@inproceedings{Vergara2015CompleteGI,
  title={Complete graph immersions in dense graphs},
  author={Sylvia Constant Vergara},
  year={2015}
}
In this article we consider the relationship between vertex coloring and the immersion order. Specifically, a conjecture proposed by Abu-Khzam and Langston in 2003, which says that the complete graph with $t$ vertices can be immersed in any $t$-chromatic graph, is studied. First, we present a general result about immersions and prove that the conjecture holds for graphs whose complement does not contain any induced cycle of length four and also for graphs having the property that every set of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

Forcing clique immersions through chromatic number

  • Electronic Notes in Discrete Mathematics
  • 2016
VIEW 3 EXCERPTS
CITES RESULTS
HIGHLY INFLUENCED

Odd disjoint trails and totally odd graph immersions

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Immersing small complete graphs

VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

On a special case of Hadwiger's conjecture

  • Discussiones Mathematicae Graph Theory
  • 2003
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Über eine Klassifikation der Streckenkomplexe

H. Hadwiger
  • Vierteljahrsschrift der Naturf. Gesellschaft in Zürich,
  • 1943
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL