On the chromatic number of \(2 K_2\)-free graphs (Q1634757): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900184847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring of \((P_3 \cup P_2)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. VI: Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of \(\{P_5,K_4\}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2876042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic bounds for some classes of \(2 K_2\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of (P_{5},windmill)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of graphs without certain induced subgraphs / rank
 
Normal rank

Latest revision as of 17:44, 17 July 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of \(2 K_2\)-free graphs
scientific article

    Statements

    On the chromatic number of \(2 K_2\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2018
    0 references
    0 references
    chromatic number
    0 references
    \(\chi\)-binding function
    0 references
    \(2 K_2\)-free graphs
    0 references
    0 references