In 1960, Dirac put forward the conjecture that r-connected 4-critical graphs exist for every r ≥ 3. In 1989, Erdös conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6,7]. Results of a computer search for graphs of degree r = 12,14,16 are presented. All the graphs found are both r-regular and r-connected
We show that three pairwise 4-regular graphs constructed by the second author are members of infinit...
A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(...
A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in...
AbstractNew examples of 4-chromatic edge-critical r-regular and r-connected graphs are presented for...
AbstractThe conjecture of Dirac that every 4-critical planar graph has a vertex of degree at most 4 ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
Using a technique which is inspired by topology we construct original examples of 3- and 4-edge crit...
AbstractIn 1970, Dirac conjectured that for every integer k⩾4, there exists a vertex k-critical grap...
AbstractWe show that there is exactly one 3-critical graph of order 22 and that there are exactly ni...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractA graph is stability critical (α-critical) if the removal of any edge increases the stabilit...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)In 2010, Barat and Toth verified that a...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractIn their paper on minimal graphs with crossing number at least k (or, equivalently, k-crossi...
We consider graphs G with ∆ = 3 such that χ′(G) = 4 and χ′(G − e) = 3 for every edge e, so-called...
We show that three pairwise 4-regular graphs constructed by the second author are members of infinit...
A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(...
A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in...
AbstractNew examples of 4-chromatic edge-critical r-regular and r-connected graphs are presented for...
AbstractThe conjecture of Dirac that every 4-critical planar graph has a vertex of degree at most 4 ...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
Using a technique which is inspired by topology we construct original examples of 3- and 4-edge crit...
AbstractIn 1970, Dirac conjectured that for every integer k⩾4, there exists a vertex k-critical grap...
AbstractWe show that there is exactly one 3-critical graph of order 22 and that there are exactly ni...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
AbstractA graph is stability critical (α-critical) if the removal of any edge increases the stabilit...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)In 2010, Barat and Toth verified that a...
A graph G is said to be k- γc-critical if the connected domination number of G, γc(G), is k and γc(G...
AbstractIn their paper on minimal graphs with crossing number at least k (or, equivalently, k-crossi...
We consider graphs G with ∆ = 3 such that χ′(G) = 4 and χ′(G − e) = 3 for every edge e, so-called...
We show that three pairwise 4-regular graphs constructed by the second author are members of infinit...
A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(...
A vertex subset D of G is a dominating set of G if every vertex in V(G)-D is adjacent to a vertex in...