An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
type: Item
instance of: scholarly article
title: An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
zbMATH Open document ID: 1008.05069
author: Hung Q. Ngo
author: Du Ding-Zhu
published in: Taiwanese Journal of Mathematics
publication date: 2003-04-02T00:00:00Z
full work available at URL: tjm0206 9.html
review text: The union of \(n\) triangles and the cycle on the \(3n\) vertices of the \(n\) triangles is called a cycle-plus-triangle graph. P. Erdős conjectured that every cycle-plus-triangle graph is \(3\)-colorable. This conjecture was proved by \textit{H. Fleischner} and \textit{M. Stiebitz} [Discrete Math. 101, 39-48 (1992; Zbl 0759.05037)]. In the present note the authors give an extension of the above conjecture with an application to switching networks.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1803275
zbMATH Keywords: switching networks
MaRDI profile type: Publication
OpenAlex ID: W2756865189
Wikidata QID: Q122928376
DOI: 10.11650/TWJM/1500407434
description: scientific article; zbMATH DE number 1803275