scientific article; zbMATH DE number 3480625
From MaRDI portal
Publication:4063176
Cited in
(87)- Large induced trees in \(K_r\)-free graphs
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- Induced subtrees in graphs of large chromatic number
- Induced cycles and chromatic number
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Triangle-free graphs and forbidden subgraphs
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- A note on chromatic number and induced odd cycles
- Chromatic number and subtrees of graphs
- Characterization of forbidden subgraphs for bounded star chromatic number
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Structure and colour in triangle-free graphs
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
- Pure pairs. II: Excluding all subdivisions of a graph
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
- From \(\chi\)- to \(\chi_p\)-bounded classes
- Fractional cocoloring of graphs
- Chordal directed graphs are not \(\chi\)-bounded
- On the chromatic number of some \(P_5\)-free graphs
- 2-divisibility of some odd hole free graphs
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Caterpillars in Erdős-Hajnal
- Restricted frame graphs and a conjecture of Scott
- Graph classes with linear Ramsey numbers
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Polynomial bounds for chromatic number VI. Adding a four-vertex path
- A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs
- Proper orientation of cacti
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Extending the Gyárfás-Sumner conjecture
- Graphs of separability at most 2
- Induced colorful trees and paths in large chromatic graphs
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- \((2P_2,K_4)\)-free graphs are 4-colorable
- First-fit coloring of bounded tolerance graphs
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Polynomial bounds for chromatic number II: Excluding a star‐forest
- Polynomial bounds for chromatic number. III. Excluding a double star
- Coloring of some crown-free graphs
- On coloring digraphs with forbidden induced subgraphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Polynomial bounds for chromatic number VII. Disjoint holes
- Coloring graphs without induced \(P_5\) or \(K_5-e\)
- A note on the Gyárfás-Sumner conjecture
- Disjointness graphs of short polygonal chains
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Hitting all maximum stable sets in P₅-free graphs
- A Generalization of \chi -Binding Functions
- Near optimal colourability on hereditary graph families
- Graphs of large chromatic number
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄
- Heroes in oriented complete multipartite graphs
- Graphs with girth 9 and without longer odd holes are 3-colourable
- Perfect divisibility and coloring of some fork-free graphs
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Structure of some ( P₇, C₄)-free graphs with application to colorings
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- The chromatic number of (\(P_5\), HVN)-free graphs
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
- Non-perfect (P₅, C₅, K₅ -e)-free graphs are 5-colorable
- On the chromatic number of a family of odd hole free graphs
- \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
- Structure and linear-Pollyanna for some square-free graphs
- Reuniting -boundedness with polynomial -boundedness
- A note on -binding functions and linear forests
- The dichromatic number of digraphs without induced subdigraphs
- Chi-boundedness of graphs containing no cycles with k chords
- Improved bounds on the chromatic number of (P₃ p₂, W₄)-free graphs
- Induced subdivisions in \(K_{s,s}\)-free graphs with polynomial average degree
- A survey of degree-boundedness
- Structure and coloring of a family of (P₇, C₅)-free graphs
- Structure and coloring of (P₇, C₅, diamond)-free graphs
- Oriented trees in \(O(k \sqrt{k})\)-chromatic digraphs, a subquadratic bound for Burr's conjecture
- Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P₄ (extended abstract)
- Near optimal colourability on (H, K_n - e)-free graphs
- Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument
- Coloring of \((P_6, \mathrm{dart}, K_4)\)-free graphs
- Optimal chromatic bound for (P₃ P₂, house)-free graphs
- Coloring of graphs without long odd holes
- Perfect divisibility and coloring in fork-free graphs
- Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
- Graphs with no long claws: an improved bound for the analog of the Gyárfás' path argument
- Nearly optimal coloring of some C₄-free graphs
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 Q4063176)
