Coloring of some crown-free graphs (Q6063283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-023-02705-0 / 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: On the chromatic number of \(2 K_2\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Q3416248 / 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 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: Q4063176 / 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: Coloring graph classes with no induced fork via perfect divisibility / 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: Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs / 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: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of χ‐boundedness / 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
Property / DOI
 
Property / DOI: 10.1007/S00373-023-02705-0 / rank
 
Normal rank

Latest revision as of 18:05, 30 December 2024

scientific article; zbMATH DE number 7761974
Language Label Description Also known as
English
Coloring of some crown-free graphs
scientific article; zbMATH DE number 7761974

    Statements

    Coloring of some crown-free graphs (English)
    0 references
    7 November 2023
    0 references
    induced subgraph
    0 references
    chromatic number
    0 references
    clique number
    0 references

    Identifiers