On bounding the difference of the maximum degree and the clique number (Q497368): 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: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C75 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6484837 / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum clique
Property / zbMATH Keywords: maximum clique / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum degree
Property / zbMATH Keywords: maximum degree / rank
 
Normal rank
Property / zbMATH Keywords
 
structural characterization of families of graphs
Property / zbMATH Keywords: structural characterization of families of graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
coloring of graphs
Property / zbMATH Keywords: coloring of graphs / rank
 
Normal rank

Revision as of 00:24, 1 July 2023

scientific article
Language Label Description Also known as
English
On bounding the difference of the maximum degree and the clique number
scientific article

    Statements

    On bounding the difference of the maximum degree and the clique number (English)
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    maximum clique
    0 references
    maximum degree
    0 references
    structural characterization of families of graphs
    0 references
    coloring of graphs
    0 references

    Identifiers