Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q113877200 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4282924791 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2005.02250 / 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: 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: On the chromatic number of \(2 K_2\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect coloring and linearly χ-boundP6-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with no induced five‐vertex path or gem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect divisibility and 2‐divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: $(2P_2,K_4)$-Free Graphs are 4-Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of (banner, odd hole)‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with no induced five‐vertex path or paraglider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial cases for the vertex coloring problem / 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: Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static frequency assignment in cellular networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. I. Odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of χ‐boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932997 / 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 23:26, 29 July 2024

scientific article
Language Label Description Also known as
English
Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
scientific article

    Statements

    Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2022
    0 references
    0 references
    \(\chi\)-binding function
    0 references
    critical graphs
    0 references
    \(P_5\)-free graphs
    0 references
    banner-free graphs
    0 references
    co-banner-free graphs
    0 references
    \(C_4\)-free graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references