scientific article; zbMATH DE number 6612443
From MaRDI portal
Publication:2993903
Recommendations
- On chromatic number of graphs without certain induced subgraphs.
- On indicated chromatic number of graphs
- The chromatic number of graphs with no induced subdivision of \(K_4\)
- Chromatic number of triangle-free graphs with some forbidden subgraphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 4085672
- On Graphs With Prescribed Chromatic Number and Subset Index
- scientific article; zbMATH DE number 426350
- Chromatic number and subtrees of graphs
- The circular chromatic number of induced subgraphs
Cited in
(13)- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
- Extension of a list coloring problem
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
- Polynomial bounds for chromatic number VI. Adding a four-vertex path
- On chromatic number of graphs without certain induced subgraphs.
- A note on a conjecture of Gy\'arf\'as
- Chromatic number of triangle-free graphs with some forbidden subgraphs
- A note on induced subtrees and chromatic number of graphs
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Polynomial bounds for chromatic number II: Excluding a star‐forest
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993903)
