DOIAbstract
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-critically (2k + 1)-connected graph. We prove here that such a graph (if there is any) has to contain less than 3k vertices
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-critically (2k + 1)-connected graph. We prove here that such a graph (if there is any) has to contain less than 3k vertices
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractLet W ⊆ V in a graph G = (V, E) such that W ∩ X ≠ Ø for each fragment X of G. Then G is defi...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractEntringer and Slater proved that every k-critically h-connected graph with h⩽2k+1 contains a...
AbstractMader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwi...
AbstractMader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwi...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
It is proved that every non-complete, finite digraph of connectivity number k has a fragment F conta...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractLet W ⊆ V in a graph G = (V, E) such that W ∩ X ≠ Ø for each fragment X of G. Then G is defi...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractEntringer and Slater proved that every k-critically h-connected graph with h⩽2k+1 contains a...
AbstractMader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwi...
AbstractMader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwi...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
AbstractIt is proven that every critically n-edge-connected finite graph G contains a vertex of degr...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
It is proved that every non-complete, finite digraph of connectivity number k has a fragment F conta...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
AbstractA graph G is called k-critical if χ(G) = k and χ(G − e) < χ(G) for each edge e of G, where χ...
AbstractLet W ⊆ V in a graph G = (V, E) such that W ∩ X ≠ Ø for each fragment X of G. Then G is defi...
A finite, simple, undirected graph is called k-critically n-connected, or, briefly, and (n, k)-graph...
Add to ORKG