A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
type: Item
instance of: scholarly article
title: A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
zbMATH Open document ID: 1225.05136
author: Jianfeng Wang
author: Chengfu Ye
author: Ru Ying Liu
author: Qiongxiang Huang
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5300679
zbMATH Keywords: adjoint polynomial
zbMATH Keywords: the smallest real root
zbMATH Keywords: the second smallest real root
zbMATH Keywords: the fourth character
zbMATH Keywords: chromatic equivalence class
MaRDI profile type: Publication
full work available at URL: j.disc.2007.07.030
OpenAlex ID: W1505677803
cites work: Q5422499
cites work: Q4529518
cites work: Q5313291
cites work: Chromaticity of some families of dense graphs
cites work: The graph parameter \(\pi(G)\) and the classification of graphs according to Itô
cites work: Q3254327
cites work: The search for chromatically unique graphs
cites work: The search for chromatically unique graphs. II
cites work: Chromatic uniqueness of a class of graphs
cites work: Q4216396
cites work: Adjoint polynomials and chromatically unique graphs
cites work: Q3819084
cites work: Q3592479
DOI: 10.1016/J.DISC.2007.07.030
description: scientific article; zbMATH DE number 5300679