Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
type: Item
instance of: scholarly article
title: Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
zbMATH Open document ID: 0870.05026
DOI: 10.1016/0012-365X(95)00301-C
author: Gerhard Benadé
author: Izak Broere
author: Betsie Jonck
author: Marietjie Frick
published in: Discrete Mathematics
publication date: 1997-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1019017
zbMATH Keywords: Hamilton path
zbMATH Keywords: colour classes
zbMATH Keywords: chromatic number
zbMATH Keywords: colourable graph
zbMATH Keywords: path number
zbMATH Keywords: longest path
zbMATH Keywords: uniquely colourable graphs
MaRDI profile type: Publication
cites work: On the order of uniquely (k,m)-colourable graphs
cites work: Q5560916
cites work: Q3818315
cites work: A Problem in Graph Theory
cites work: Uniquely colorable graphs
cites work: Q4294602
cites work: Saturated graphs with minimal number of edges
full work available at URL: 0012-365x(95)00301-c
OpenAlex ID: W2770404470
description: scientific article; zbMATH DE number 1019017