On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of \((P_{5},K_{2,t})\)-free graphs / 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 divisibility and 2‐divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: 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: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / 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: Vizing bound for the chromatic number on some graph classes / 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: Chromatic number of \(P_5\)-free graphs: Reed's conjecture / 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: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path / 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 11:28, 3 August 2024

scientific article; zbMATH DE number 7761584
Language Label Description Also known as
English
On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
scientific article; zbMATH DE number 7761584

    Statements

    On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (English)
    0 references
    0 references
    0 references
    6 November 2023
    0 references
    \(P_5\)-free graph
    0 references
    chromatic number
    0 references
    polynomial \(\chi\)-boundedness
    0 references
    intersecting cliques
    0 references

    Identifiers