AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critical graph on n vertices in order to make it bipartite is at least k2 for n large enough. This bound is best possible. Various related questions are considered
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractA graph G is (k+1)-critical if it is not k-colourable but G−e is k-colourable for any edge e...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-c...
AbstractErdős asked if the removal of few edges in a large 4-color-critical graph always leaves a 3-...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
AbstractA graph G is (k+1)-critical if it is not k-colourable but G−e is k-colourable for any edge e...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
Let $r$ be any positive integer. We prove that for every sufficiently large $k$ there exists a $k$-c...
AbstractErdős asked if the removal of few edges in a large 4-color-critical graph always leaves a 3-...
AbstractSeveral structure theorems on chromatic index critical graphs are proved. New lower bounds o...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
We consider questions regarding the existence of graphs and hypergraphs with certain coloring proper...
AbstractA graph is chromatic-index-critical if it cannot be edge-coloured with Δ colours (with Δ the...
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by...
This thesis focuses on extremal problems about coloring graphs and on finding rainbow matchings in e...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
AbstractWe give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or...
DOI
Add to ORKG