On the \(b\)-chromatic number of regular graphs without 4-cycle (Q427905): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6047063 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(b\)-chromatic number
Property / zbMATH Keywords: \(b\)-chromatic number / rank
 
Normal rank
Property / zbMATH Keywords
 
girth
Property / zbMATH Keywords: girth / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter
Property / zbMATH Keywords: diameter / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex connectivity
Property / zbMATH Keywords: vertex connectivity / rank
 
Normal rank

Revision as of 23:12, 29 June 2023

scientific article
Language Label Description Also known as
English
On the \(b\)-chromatic number of regular graphs without 4-cycle
scientific article

    Statements

    On the \(b\)-chromatic number of regular graphs without 4-cycle (English)
    0 references
    0 references
    18 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(b\)-chromatic number
    0 references
    girth
    0 references
    diameter
    0 references
    vertex connectivity
    0 references