The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subtrees in graphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / 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: 3-colorability and forbidden subgraphs. I: Characterizing pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-colourability and forbidden subgraphs. II: Polynomial algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424790 / 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: 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: 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 / cites work
 
Property / cites work: Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree / rank
 
Normal rank

Revision as of 23:20, 24 July 2024

scientific article
Language Label Description Also known as
English
The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
scientific article

    Statements

    The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (English)
    0 references
    0 references
    0 references
    15 April 2021
    0 references
    chromatic number
    0 references
    triangle-free graph
    0 references
    broom-free graph
    0 references

    Identifiers