Chromatically Equivalent Graphs with P(G, λ) = (λ- λ<SUB>1</SUB>)(λ-λ<SUB>2</SUB>)λ￣(n+1)

Han Botang. Chromatically Equivalent Graphs with P(G, λ) = (λ- λ1)(λ-λ2)λ￣(n+1)[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 115-122.

Citation:

Han Botang. Chromatically Equivalent Graphs with P(G, λ) = (λ- λ1)(λ-λ2)λ￣(n+1)[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 115-122.

Citation:

Han Botang. Chromatically Equivalent Graphs with P(G, λ) = (λ- λ1)(λ-λ2)λ￣(n+1)[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 115-122.

Chromatically Equivalent Graphs with P(G, λ) = (λ- λ₁)(λ-λ₂)λ￣(n+1)

Abstract

The author finds out all of the graphs with the same chromatic polynomial and proves some relevant theorems and corollaries.

FullText(HTML)