AbstractWe show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set. This was conjectured by Maurer and Slater
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractLet W ⊆ V in a graph G = (V, E) such that W ∩ X ≠ Ø for each fragment X of G. Then G is defi...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractLet G be a graph with K(G)=h. A vertex v of G is called k-critical if k(G−v)=h−1. Generalizi...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractFor a connected graph G, the restricted edge-connectivity λp(G) is defined as the minimum ca...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
AbstractWe prove that every n-connected graph G of sufficiently large order contains a connected gra...
AbstractA noncomplete graph G is called an (n, k)-graph if it is n-connected and G−X is not (n−|X|+1...
AbstractLet W ⊆ V in a graph G = (V, E) such that W ∩ X ≠ Ø for each fragment X of G. Then G is defi...
AbstractThe vertex connectivity of a graph G is denoted by κ(G) and the minimum degree of G is denot...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractFor k⩾0, ϱk(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, ...
AbstractLet G be a graph with K(G)=h. A vertex v of G is called k-critical if k(G−v)=h−1. Generalizi...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractThe following result is proved: Every finite n-connected graph G contains either a vertex of...
AbstractFor a connected graph G, the restricted edge-connectivity λp(G) is defined as the minimum ca...
Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
AbstractA subgraph H of a 3-connected finite graph G is called contractible if H is connected and G−...
AbstractThe connected cutset connectivity (connected edge-cutset connectivity) of a nontrivial conne...
DOI
Add to ORKG