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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of uniquely (k,m)-colourable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturated graphs with minimal number of edges / rank
 
Normal rank

Latest revision as of 14:11, 27 May 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