The chromatic equivalence class of graph Bn-6,12

DOI10.7151/DMGT.1401MaRDI QIDQ3606450zbMATH OpenOpenAlexFDO

Authors Jianfeng Wang, Chengfu Ye, Qiongxiang Huang, Ru Ying Liu

Publication date 26 February 2009

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1401

zbMATH Keywords

adjoint polynomialchromatic equivalence classfourth charactersamllest real rootsecond smallest real root

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\)
• The chromatic equivalence class of graph \(\psi_n^3(n-3,1)\).
• The fifth coefficient of adjoint polynomial and a new invariant.

Cited in

(4)

• A complete solution to the chromatic equivalence class of graph \(\overline{\zeta^1_n}\)
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• The chromatic equivalence class of graph \(\psi_n^3(n-3,1)\).
• A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\)

This page was built for publication: The chromatic equivalence class of graph B_n-6,12

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606450)