See this document in CiteSeerX!

Hadwiger Number and the Cartesian Product Operation on Graphs  (Make Corrections)  
Master of Science in the Faculty of Engineering Department of Computer...



  Home/Search   Context   Related

 
View or download:
drona.csa.iisc.ernet....rajuthesis.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  drona.csa.iisc.ernet.in/~sunil... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The Hadwiger number is defined as the largest integer for which the complete graph on nodes . Hadwiger conjectured that for any    ,where is the chromatic number of . In this thesis, we investigate the Hadwiger number with respect to the cartesian product operation on Graphs. As the main result of this thesis, we show that for any two graphs       !"#  $ %&(' )*' +&-,. . (Since isomorphic to / 0 , we... (Update)

Active bibliography (related documents):   More   All
0.5:   Median Graphs and Triangle-Free Graphs - Imrich (1999)   (Correct)
0.5:   Minors in Graphs of Large Girth - Kühn, Osthus   (Correct)
0.2:   Application of Upper and Lower Bounds for the Domination.. - Edwin Clark Mourad (2003)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ science-hadwiger,
  author = "Master Of Science",
  title = "Hadwiger Number and the Cartesian Product Operation on Graphs",
  url = "citeseer.ist.psu.edu/760497.html" }
Citations (may not include all citations):
14   Springer Verlag (context) - Diestel, volume - 2000
11   A property of 4-chromatic graphs and some remarks on critica.. (context) - Dirac - 1952
10   Uber eine Klassifikation der Streckenkomplexe (context) - Hadwiger - 1943
4   Domination in cartesian products: Vizing's conjecture (context) - Hartnell, Rall - 1998
2   Dense minors in graphs of large girth - Diestel, Rempel - 2005
2   Cartesian graph factorization at logarithmic cost per edge (context) - Aurenhammer, Hagauer et al. - 1992
1   the structure of 5- and 6- chromatic abstract graphs (context) - Dirac - 1964
1   To appear in Random Structures and Algorithms (context) - Drier, Linial et al.

Documents on the same site (http://drona.csa.iisc.ernet.in/~sunil/):
A Project Report - Submitted In Partial   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC