Greedy \(F\)-colorings of graphs (Q1415540): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2765170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equality of the grundy and ochromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243805 / rank
 
Normal rank

Revision as of 13:08, 6 June 2024

scientific article
Language Label Description Also known as
English
Greedy \(F\)-colorings of graphs
scientific article

    Statements

    Greedy \(F\)-colorings of graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(F\)-coloring
    0 references
    \(F\)-chromatic number
    0 references
    Greedy \(F\)-coloring
    0 references
    Greedy \(F\)-chromatic number
    0 references