AbstractA skew star is a tree with exactly three vertices of degree one being at distance 1, 2, 3 from the only vertex of degree three. In the present paper, we propose a structural characterization for the class of bipartite graphs containing no skew star as an induced subgraph and discuss some applications of the obtained result
We prove a decomposition theorem for graphs that do not contain a subdi-vision of K4 as an induced s...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA graph is prismatic if for every triangle T, every vertex not in T has exactly one neighbou...
AbstractA tree is said to be starlike if exactly one of its vertices has degree greater than two. We...
The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, ...
In this paper we propose a structural characterization for a class of bipartite graphs defined by tw...
A spanning tree of a graph is a k-additive tree spanner whenever the distance of every two vertices ...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
AbstractA connected graph Γ is said to be distance-balanced whenever for any pair of adjacent vertic...
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove t...
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove t...
a (p, q)-tree if |E(G) | = p + q − 1 and G has no cycles. A bipartite graph G = (L, R; E) is a subg...
A tree is called a k-tree if its maximum degree is at most k. We prove the following theorem. Let k&...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
Let R and B be two disjoint sets of points in the plane such that | B| ≤ | R| , and no three points ...
We prove a decomposition theorem for graphs that do not contain a subdi-vision of K4 as an induced s...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA graph is prismatic if for every triangle T, every vertex not in T has exactly one neighbou...
AbstractA tree is said to be starlike if exactly one of its vertices has degree greater than two. We...
The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, ...
In this paper we propose a structural characterization for a class of bipartite graphs defined by tw...
A spanning tree of a graph is a k-additive tree spanner whenever the distance of every two vertices ...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
AbstractA connected graph Γ is said to be distance-balanced whenever for any pair of adjacent vertic...
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove t...
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove t...
a (p, q)-tree if |E(G) | = p + q − 1 and G has no cycles. A bipartite graph G = (L, R; E) is a subg...
A tree is called a k-tree if its maximum degree is at most k. We prove the following theorem. Let k&...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
Let R and B be two disjoint sets of points in the plane such that | B| ≤ | R| , and no three points ...
We prove a decomposition theorem for graphs that do not contain a subdi-vision of K4 as an induced s...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractA graph is prismatic if for every triangle T, every vertex not in T has exactly one neighbou...
DOI
Add to ORKG