The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On \(b\)-colorings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-chromatic number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the b-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-chromatic number of regular bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-dominating coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-chromatic number of regular graphs without 4-cycle / rank
 
Normal rank

Revision as of 09:03, 9 July 2024

scientific article
Language Label Description Also known as
English
The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs
scientific article

    Statements

    The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 December 2014
    0 references
    coloring
    0 references
    regular graphs
    0 references
    \(b\)-chromatic number
    0 references
    \(f\)-chromatic vertex number
    0 references

    Identifiers