#### Filter Results:

#### Publication Year

2000

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial.) 3 (≥ m C m 2 , 2 , 2 K Let G be a finite graph with neither loops nor multiple edges and let) ; (λ G P denote its chromatic polynomial. Then G is said to be chromatically unique if) ;… (More)

This paper investigates on those smallest regular graphs with given girths and having small crossing numbers.

- ‹
- 1
- ›