AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that each vertex is adjacent to one and only one vertex in the set not containing it. A tree with 2 n vertices is bivariegated if and only if the largest independent subset of the vertex set has cardinal n. A constructive description of such trees as well as a listing of all those with 12 or fewer vertices is given
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractA spanning tree of a connected graph G is said to be an independency tree if all its endvert...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
Given a bipartite graph $H=(V=V_A\cup V_B,E)$ in which any vertex in $V_A$ (resp. $V_B$) has degree ...
AbstractThe notion of balanced bipartitions of the vertices in a tree T was introduced and studied b...
AbstractA graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
Richard Ehrenborg conjectured that in a bipartite graph G with parts X and Y, the number of spanning...
In this thesis we investigate three different aspects of graph theory. Firstly, we consider interes...
AbstractThe neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such...
AbstractAn independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipa...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
AbstractA graph is said to be k-variegated if its vertex set can be partitioned into k equal parts s...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractA spanning tree of a connected graph G is said to be an independency tree if all its endvert...
AbstractA graph is bivariegated if its vertex set can be partitioned into two equal sets such that e...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
Given a bipartite graph $H=(V=V_A\cup V_B,E)$ in which any vertex in $V_A$ (resp. $V_B$) has degree ...
AbstractThe notion of balanced bipartitions of the vertices in a tree T was introduced and studied b...
AbstractA graph is equitably k-colorable if its vertices can be partitioned into k independent sets ...
Richard Ehrenborg conjectured that in a bipartite graph G with parts X and Y, the number of spanning...
In this thesis we investigate three different aspects of graph theory. Firstly, we consider interes...
AbstractThe neighborhood of a pair of vertices u, v in a triple system is the set of vertices w such...
AbstractAn independent set of a graph is a subset of pairwise non-adjacent vertices. A complete bipa...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
AbstractA subset S of vertices of a graph G is independent if no two vertices in S are adjacent. In ...
AbstractA graph is said to be k-variegated if its vertex set can be partitioned into k equal parts s...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractA spanning tree of a connected graph G is said to be an independency tree if all its endvert...
DOI
Add to ORKG