A result on chromatic uniqueness of edge-gluing of graphs
In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial.
保存先:
| 主要な著者: | , |
|---|---|
| その他の著者: | |
| フォーマット: | 論文 |
| 出版事項: |
2023
|
| 主題: | |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | In this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial. |
|---|