AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges
International audienceA b-coloring of a graph G is a proper coloring of the vertices of G such that ...
Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic...
AbstractA graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G it...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractThe following theorem is proved: Let n, k be natural numbers, n ⩾ 3, let A be a set and A1,A...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extre...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
AbstractThe hypergraphs whose chromatic number is at most 2 (“bicolorable” hypergraphs) were introdu...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
International audienceA b-coloring of a graph G is a proper coloring of the vertices of G such that ...
Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic...
AbstractA graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G it...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractThe following theorem is proved: Let n, k be natural numbers, n ⩾ 3, let A be a set and A1,A...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extre...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
AbstractThe hypergraphs whose chromatic number is at most 2 (“bicolorable” hypergraphs) were introdu...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
International audienceA b-coloring of a graph G is a proper coloring of the vertices of G such that ...
Given two graphs H1 and H2, a graph G is (H1, H2)-free if it contains no induced subgraph isomorphic...
AbstractA graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G it...
DOI
Add to ORKG