\(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
type: Item
instance of: scholarly article
title: \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
zbMATH Open document ID: 1027.05040
author: B. S. Sadjad
author: S. Akbari
author: Vahab S. Mirrokni
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1843776
MaRDI profile type: Publication
full work available at URL: jctb.2000.2028
OpenAlex ID: W2050101460
cites work: Uniquely Colourable Graphs with Large Girth
cites work: On uniquely 3-colorable graphs
cites work: Q4071278
cites work: Uniquely colorable graphs
cites work: Q5672924
cites work: The size of uniquely colorable graphs
DOI: 10.1006/JCTB.2000.2028
Recommended article: Construction of uniquely vertex k-colorable graphs with minimum possible size
Recommended article: ON UNIQUELY -G k-COLOURABLE GRAPHS
Recommended article: Q3691757
Recommended article: A characterization of uniquely vertex colorable graphs using minimal defining sets
Recommended article: Q3755470
Recommended article: Q4294231
Recommended article: Q5740788
Recommended article: Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
Recommended article: The existence of uniquely \(-G\) colourable graphs
Recommended article: Uniquely \(n\)-colorable and chromatically equivalent graphs
description: scientific article; zbMATH DE number 1843776