Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
type: Item
instance of: scholarly article
title: Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
zbMATH Open document ID: 0881.05049
DOI: 10.1016/S0012-365X(96)00265-8
author: K. Z. Ouyang
author: Xiang'en Chen
published in: Discrete Mathematics
publication date: 1998-02-16T00:00:00Z
review text: Let \(S\) denote the class of 2-connected \((n,n+2)\)-graphs which have girth 5 and are not homeomorphic to \(K_4\). This paper determines the chromatic classes of graphs in \(S\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1061979
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: chromatically equivalent
zbMATH Keywords: chromatic classes
MaRDI profile type: Publication
cites work: A new 5‐arc‐transitive cubic graph
cites work: Q3313882
cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph
cites work: An introduction to chromatic polynomials
cites work: Q4000770
cites work: Cutpoints and the chromatic polynomial
description: scientific article; zbMATH DE number 1061979