DOIAbstract
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
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
A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G i...
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essen...
AbstractOn-line coloring of a graph is the following process. The graph is given vertex by vertex (w...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
AbstractOn-line coloring of a graph is the following process. The graph is given vertex by vertex (w...
AbstractThe vertex-critical graph conjecture (critical graph conjecture respectively) states that ev...
AbstractSumner defined a graph to be point determining if and only if distinct points have distinct ...
AbstractLet β(G) be the maximal β such that for any edge xy of G there is an independent β-set that ...
AbstractWe prove that a connected graph with at least nine vertices is a line graph if and only if i...
AbstractWe prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, e...
© 2018, University of Queensland. All rights reserved. Let ? i (G) denote the independent domination...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G i...
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essen...
AbstractOn-line coloring of a graph is the following process. The graph is given vertex by vertex (w...
AbstractWe show that any line graph contains a set of three vertices which is not included in a smal...
AbstractOn-line coloring of a graph is the following process. The graph is given vertex by vertex (w...
AbstractThe vertex-critical graph conjecture (critical graph conjecture respectively) states that ev...
AbstractSumner defined a graph to be point determining if and only if distinct points have distinct ...
AbstractLet β(G) be the maximal β such that for any edge xy of G there is an independent β-set that ...
AbstractWe prove that a connected graph with at least nine vertices is a line graph if and only if i...
AbstractWe prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, e...
© 2018, University of Queensland. All rights reserved. Let ? i (G) denote the independent domination...
AbstractA conjecture of Slater states that Kh + 1 is the unique k-critically h-connected noncomplete...
AbstractA well-known conjecture of P. J. Slater says that there is no non-complete (k + 1)-criticall...
AbstractA graph G which is n-connected (but not (n + 1)-connected)is defined to be k-critical if for...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G i...
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essen...
AbstractOn-line coloring of a graph is the following process. The graph is given vertex by vertex (w...
Add to ORKG