The chromaticity of \(s\)-bridge graphs and related graphs
type: Item
instance of: scholarly article
title: The chromaticity of \(s\)-bridge graphs and related graphs
zbMATH Open document ID: 0814.05036
DOI: 10.1016/0012-365X(93)E0091-H
author: Jinjie Liu
author: Yee-Hock Peng
author: Shaoji Xu
published in: Discrete Mathematics
publication date: 1995-02-01T00:00:00Z
review text: The graph consisting of \(s\) paths joining two vertices is called an \(s\)- bridge graph. Necessary and sufficient conditions for a 4-bridge graph to be chromatically unique are given. Some classes of graphs which are chromatically unique or chromatically equivalent to \(s\)-bridge graphs are considered too.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 716468
zbMATH Keywords: chromaticity
zbMATH Keywords: \(s\)-bridge graph
zbMATH Keywords: chromatically unique
zbMATH Keywords: chromatically equivalent
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
cites work: On chromatic equivalence of graphs
cites work: Q3313882
cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph
cites work: The chromaticity of complete bipartite graphs with at most one edge deleted
cites work: Q4000798
cites work: Classes of chromatically equivalent graphs and polygon trees
full work available at URL: 0012-365x(93)e0091-h
OpenAlex ID: W2030247057
description: scientific article; zbMATH DE number 716468