Publication date
January 1994
DOIAbstract
We 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
We 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...
AbstractA graph G is quasi claw-free if it satisfies the property: d(x, y) = 2 ⇒ there exists u ϵ N(...
AbstractA reduced map is a continuous function such that the preimage of every proper subcontinuum o...
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 ...
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 ...
AbstractWe characterize all the 4-connected claw-free graphs not containing a subdivision of K5. We ...
We consider the class Gm of 3-colorable graphs containing neither claw nor hole of length more thanm...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
summary:A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1,3}$ (claw) a...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
AbstractA graph G is quasi claw-free if it satisfies the property: d(x, y) = 2 ⇒ there exists u ϵ N(...
AbstractA reduced map is a continuous function such that the preimage of every proper subcontinuum o...
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 ...
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 ...
AbstractWe characterize all the 4-connected claw-free graphs not containing a subdivision of K5. We ...
We consider the class Gm of 3-colorable graphs containing neither claw nor hole of length more thanm...
AbstractIn this paper we characterize those forbidden triples of graphs, no one of which is a genera...
AbstractIf π is a property on graphs, the corresponding edge deletion (edge contraction, respectivel...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
summary:A graph $G$ is a minimal claw-free graph (m.c.f. graph) if it contains no $K_{1,3}$ (claw) a...
AbstractA graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier pape...
AbstractA graph G is quasi claw-free if it satisfies the property: d(x, y) = 2 ⇒ there exists u ϵ N(...
AbstractA reduced map is a continuous function such that the preimage of every proper subcontinuum o...
Add to ORKG