Edge-\(b\)-coloring trees (Q1702122): 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: Q5422499 / 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: The \(b\)-chromatic index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of girth at least 7 have high \(b\)-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(b\)-coloring of tight 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: Some bounds for 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: Q3424784 / rank
 
Normal rank

Latest revision as of 06:29, 15 July 2024

scientific article
Language Label Description Also known as
English
Edge-\(b\)-coloring trees
scientific article

    Statements

    Edge-\(b\)-coloring trees (English)
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(b\)-chromatic number
    0 references
    \(b\)-chromatic index
    0 references
    trees
    0 references
    claw-free block graphs
    0 references
    dynamic programming
    0 references
    0 references
    0 references