The \(b\)-chromatic number of regular graphs via the edge-connectivity (Q393940): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / 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: 6250028 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(b\)-coloring
Property / zbMATH Keywords: \(b\)-coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
\(b\)-chromatic number
Property / zbMATH Keywords: \(b\)-chromatic number / rank
 
Normal rank
Property / zbMATH Keywords
 
edge-connectivity
Property / zbMATH Keywords: edge-connectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
super-edge-connected
Property / zbMATH Keywords: super-edge-connected / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964234691 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.2909 / rank
 
Normal rank
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: Q3565952 / 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: The b-chromatic number of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(b\)-coloring of the Kneser graphs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:14, 7 July 2024

scientific article
Language Label Description Also known as
English
The \(b\)-chromatic number of regular graphs via the edge-connectivity
scientific article

    Statements

    The \(b\)-chromatic number of regular graphs via the edge-connectivity (English)
    0 references
    0 references
    24 January 2014
    0 references
    \(b\)-coloring
    0 references
    \(b\)-chromatic number
    0 references
    edge-connectivity
    0 references
    super-edge-connected
    0 references

    Identifiers