THE EQUALIZED TOTAL COLORING OF THE BIPARTITE GRAPHS
碩士 === 東海大學 === 數學系 === 85 === We find out a class of counter-examples against bipartite graph $G$ has an equalized total $k$-coloring for each $k\geq \chi_{t}(G)$. In [6], Fu broughtthe conjecture~:~ For every simple graph $G$, $G$ has...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67394180283870541899 |