On the Hadwiger's conjecture for graph products

@article{Chandran2007OnTH,
  title={On the Hadwiger's conjecture for graph products},
  author={L. Sunil Chandran and Naveen Sivadasan},
  journal={Discrete Mathematics},
  year={2007},
  volume={307},
  pages={266-273}
}
The Hadwiger number (G) of a graph G is the largest integer h such that the complete graph on h nodes Kh is a minor of G. Equivalently, (G) is the largest integer such that any graph on at most (G) nodes is a minor of G. The Hadwiger’s conjecture states that for any graph G, (G) (G), where (G) is the chromatic number of G. It is well-known that for any connected undirected graph G, there exists a unique prime factorization with respect to Cartesian graph products. If the unique prime… CONTINUE READING
6 Citations
30 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Some theorems on abstract graphs

  • G. A. Dirac
  • Proc. of London Math. Soc
  • 1952
Highly Influential
4 Excerpts

Dirac , Some theorems on abstract graphs

  • A. G.
  • Proc . of London Math . Soc .
  • 2005

The minimum hadwiger number of graphs with a given mean degree of vertices , Metody Diskret

  • A. V. Kostochka
  • Analiz .
  • 1996

Similar Papers

Loading similar papers…