A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bao-Gang Xu / rank
Normal rank
 
Property / author
 
Property / author: Bao-Gang Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4362553893 / 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: Dominating cliques in \(P_ 5\)-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: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal χ‐bound for (P6, diamond)‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of \((P_5, 4\)-wheel)-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: 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: Coloring graphs with no induced five‐vertex path or gem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of some \(P_5\)-free 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: Q4063176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / 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: On graphs with no induced five‐vertex path or paraglider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / 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: 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: 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 01:44, 1 August 2024

scientific article
Language Label Description Also known as
English
A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
scientific article

    Statements

    A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    0 references
    \(P_5\)-free
    0 references
    chromatic number
    0 references
    induced subgraph
    0 references
    0 references
    0 references
    0 references
    0 references