AbstractOur paper proves special cases of the following conjecture: for any fixed tree T there exists a natural number f = f (T) to that every triangle-free graph of chromaticnumber f(T) contains T as an induced subgraph. The main result concerns the case when T has radius two
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2022.09.001 © 2023...
AbstractOur paper proves special cases of the following conjecture: for any fixed tree T there exist...
In a proper vertex coloring of a graph a subgraph is colorful if its vertices are colored with dif...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there...
AbstractA graph G is chromatically k-connected if every vertex cutset induces a subgraph with chroma...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
We prove that for every $n$, there is a graph $G$ with $\chi(G) \geq n$ and $\omega(G) \leq 3$ such ...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
Gyárfás conjectured in 1985 that for all k, `, every graph with no clique of size more than k and ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2022.09.001 © 2023...
AbstractOur paper proves special cases of the following conjecture: for any fixed tree T there exist...
In a proper vertex coloring of a graph a subgraph is colorful if its vertices are colored with dif...
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triang...
We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there...
AbstractA graph G is chromatically k-connected if every vertex cutset induces a subgraph with chroma...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
We prove that for every $n$, there is a graph $G$ with $\chi(G) \geq n$ and $\omega(G) \leq 3$ such ...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
Gyárfás conjectured in 1985 that for all k, `, every graph with no clique of size more than k and ...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for...
Gyárfás conjectured in 1985 that for all k, ℓ, every graph with no clique of size more than k and no...
The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2022.09.001 © 2023...
DOI
Add to ORKG