On bounding the difference of the maximum degree and the clique number (Q497368): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1511.08403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Hitting Maximum and Maximal Cliques With a Stable Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Graphs of Helly Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (\(\Delta-k\))-critical graphs / rank
 
Normal rank

Latest revision as of 20:09, 10 July 2024

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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references