Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (Q1356650): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 15:27, 31 January 2024

scientific article
Language Label Description Also known as
English
Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
scientific article

    Statements

    Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamilton path
    0 references
    colour classes
    0 references
    chromatic number
    0 references
    colourable graph
    0 references
    path number
    0 references
    longest path
    0 references
    uniquely colourable graphs
    0 references