\(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uniquely Colourable Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniquely 3-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of uniquely colorable graphs / rank
 
Normal rank

Latest revision as of 19:10, 4 June 2024

scientific article
Language Label Description Also known as
English
\(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
scientific article

    Statements

    \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2002
    0 references
    0 references
    0 references