Add to ORKGA graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colorable. Let fk(n) denote the minimum number of edges in an n-vertex k-critical graph. Recently the authors gave a lower bound, fk(n)
AbstractThis paper presents algorithms to find vertex-critical and edge-critical subgraphs in a give...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
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...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractA graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G it...
AbstractThis paper presents algorithms to find vertex-critical and edge-critical subgraphs in a give...
AbstractIn this paper we discuss some basic properties of k-list critical graphs. A graph G is k-lis...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
International audienceA b-coloring of a graph G is a proper coloring of the vertices of G such that ...
AbstractThis paper presents algorithms to find vertex-critical and edge-critical subgraphs in a give...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractA graph G is called k-critical if G is k-chromatic but every proper subgraph of G has chroma...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
AbstractIt is shown that the minimal number of edges which have to be omitted from a (k + 1)-critica...
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...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractA graph G is k-critical if every proper subgraph of G is (k−1)-colorable, but the graph G it...
AbstractThis paper presents algorithms to find vertex-critical and edge-critical subgraphs in a give...
AbstractIn this paper we discuss some basic properties of k-list critical graphs. A graph G is k-lis...
AbstractThis paper gives new constructions of k-chromatic critical graphs with high minimum degree a...
International audienceA b-coloring of a graph G is a proper coloring of the vertices of G such that ...
AbstractThis paper presents algorithms to find vertex-critical and edge-critical subgraphs in a give...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...