Dissertation > Excellent graduate degree dissertation topics show

Coloring of Some Classes of Expansion Graphs

Author: WangJiang
Tutor: AYongGa
School: Inner Mongolia Normal
Course: Applied Mathematics
Keywords: Maximum expansion graph Total coloring Equitable coloring
CLC: O157.5
Type: Master's thesis
Year: 2011
Downloads: 14
Quote: 0
Read: Download Dissertation

Abstract


Graph coloring theory is playing a very important role in graph theory, and total coloring is a popular topic for researchers. This paper studies chromatic number problem of the maximum expansion graph.First,it proves that the maximum expansion graph is to meet the total coloring conjecture demand.Second, it shows the maximum expansion graph is a necessary condition for the first class diagram. On the basis of this condition, there is a total coloring method for the maximum expansion graph.Last,it proves that the maximum expansion of regular graphs is to satisfy the equitable total-coloring conjecture.

Related Dissertations

  1. Group Chromatic Number of Some Kinds of Graphs,O157.5
  2. On Two Coloring of Planar Graphs,O157.5
  3. Research on Colorings of Designs and Related Problems,O157.5
  4. Some Topics on Restricted Coloring Problems of Graphs,O157.5
  5. Equitable Colorings of Graphs,O157.5
  6. On the Total Coloring and the Adjacent Vertex Distinguishing Total Coloring of Joint Graphs,O157.5
  7. Equitable Total Coloring on map,O157.5
  8. Two types of operations Adjacent Strong Edge Chromatic Number and adjacent vertex distinguishing total chromatic number,O157.5
  9. Several Special Proper Total Colorings of Graphs,O157.5
  10. Adjacent vertex distinguishing total coloring and a full- boson map coloring problem restricted,O157.5
  11. Vertex-distinguishing Total Coloring of Ladder Graphs,O157.5
  12. Three types of graphs and probabilistic methods dyeing,O157.5
  13. Some Results on Cycles and Path-Factors in Graphs and the Studying on Total Coloring Conjecture of Planar Graphs,O157.5
  14. The Total Coloring of Particular Planar Graphs,O157.5
  15. Study on the Problem of Adjacent Vertex-Distinguishing Total Coloring of Graphs,O157.5
  16. Graph coloring,O157.5
  17. On the Coloring of Halin Graphs,O157.5
  18. The Vertex-distinguishing Edge-Coloring and the Vertex-distinguishing Total Coloring of Graph,O157.5
  19. The point on the map coloring problem distinguishing,O157.5
  20. The Research of Algorithm for Strong Vertex-distinguishing Total Coloring,O157.5
  21. Staining adjacent vertex distinguishing total coloring and two special issues,O157.5

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net  Mobile