AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by the properties of being reduced, not having 3-claws, and having disconnected μ-graphs
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
We describe $Forb\{K_{1,3}, \overline {K_{1,3}}\}$, the class of graphs $G$ such that $G$ and its ...
Since it has been difficult to characterize well-dominated graphs in general, we narrow our perspect...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series ...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractA constructive characterization of the class of minimally 3-connected graphs is presented. T...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIt is shown, as a complement to Tutte's theorem, that for a given 3-connected graph K which ...
We describe $Forb\{K_{1,3}, \overline {K_{1,3}}\}$, the class of graphs $G$ such that $G$ and its ...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
We describe $Forb\{K_{1,3}, \overline {K_{1,3}}\}$, the class of graphs $G$ such that $G$ and its ...
Since it has been difficult to characterize well-dominated graphs in general, we narrow our perspect...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
We show that the lattice graphs (grids) and one other family of graphs are characterized by the prop...
AbstractWe show that the lattice graphs (grids) and one other family of graphs are characterized by ...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series ...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractA constructive characterization of the class of minimally 3-connected graphs is presented. T...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIt is shown, as a complement to Tutte's theorem, that for a given 3-connected graph K which ...
We describe $Forb\{K_{1,3}, \overline {K_{1,3}}\}$, the class of graphs $G$ such that $G$ and its ...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
We describe $Forb\{K_{1,3}, \overline {K_{1,3}}\}$, the class of graphs $G$ such that $G$ and its ...
Since it has been difficult to characterize well-dominated graphs in general, we narrow our perspect...