scientific article; zbMATH DE number 3747156

Cited in

(96)

Large induced trees in $K_r$-free graphs
Applications of edge coloring of multigraphs to vertex coloring of graphs
Effective on-line coloring of $P_ 5$-free graphs
Colorful induced subgraphs
Induced cycles and chromatic number
Dominating subgraphs in graphs with some forbidden structures
Claw-free graphs---a survey
3-colorability and forbidden subgraphs. I: Characterizing pairs
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
Colouring squares of claw-free graphs
Chromatic number and subtrees of graphs
Characterization of forbidden subgraphs for bounded star chromatic number
Polynomial $\chi $-binding functions and forbidden induced subgraphs: a survey
Applications of hypergraph coloring to coloring graphs not inducing certain trees
On forbidden induced subgraphs for $K_{1, 3}$-free perfect graphs
Induced subgraphs of graphs with large chromatic number. XIII. New brooms
Extension of Gyárfás-Sumner conjecture to digraphs
Structure and colour in triangle-free graphs
The structure of claw-free binary matroids
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
Pure pairs. II: Excluding all subdivisions of a graph
From $\chi$- to $\chi_p$-bounded classes
Fractional cocoloring of graphs
Chordal directed graphs are not $\chi$-bounded
Forbidden induced pairs for perfectness and $\omega$-colourability of graphs
On the chromatic number of some $P_5$-free graphs
On indicated coloring of lexicographic product of graphs
Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions
Coloring graphs with no even hole $\geqslant 6$: the triangle-free case
Caterpillars in Erdős-Hajnal
Coloring graphs without short cycles and long induced paths
Graph classes with linear Ramsey numbers
The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
Degeneracy of $P_t$-free and $C_{\geq t}$-free graphs with no large complete bipartite subgraphs
Decomposing and colouring some locally semicomplete digraphs
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
Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
Induced subgraphs of graphs with large chromatic number. I. Odd holes
Extending the Gyárfás-Sumner conjecture
Colouring squares of claw-free graphs
Treewidth versus clique number. I: Graph classes with a forbidden structure
Induced colorful trees and paths in large chromatic graphs
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
The structure of I₄-free and triangle-free binary matroids
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
Polynomial bounds for chromatic number VII. Disjoint holes
On the chromatic number of $P_5$-free graphs with no large intersecting cliques
Coloring graphs without induced $P_5$ or $K_5-e$
A note on the Gyárfás-Sumner conjecture
Divisibility and coloring of some $P_5$-free graphs
On the chromatic number of (P5,dart)-free graphs
Trees in greedy colorings of hypergraphs
Polynomial $\chi$-binding functions for $t$-broom-free graphs
Indicated coloring of the Mycielskian of some families of graphs
A Ramsey–Turán theory for tilings in graphs
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
$ \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
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
H-factors in graphs with small 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 heroes in digraphs with forbidden induced forests
$(\overrightarrow{P_6}$, triangle)-free digraphs have bounded dichromatic number
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
Longest path transversals in claw-free and P₅-free graphs
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
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)
Kővári-Sós-Turán theorem for hereditary families
Towards optimal -binding functions of (2K₁ K₂)-free graphs and (P₃ K₁)-free graphs
The number of edge colorings with small independence number and no monochromatic H
Coloring of $(P_6, \mathrm{dart}, K_4)$-free graphs
-boundedness and related problems on graphs without long induced paths: a survey
Optimal chromatic bound for (P₃ P₂, house)-free graphs
Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
Title not available (Why is no real title available?)
Square-free graphs with no induced fork

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 Q3932997)