Add to ORKGa (p, q)-tree if |E(G) | = p + q − 1 and G has no cycles. A bipartite graph G = (L, R; E) is a subgraph of a bipartite graph H = (L′, R′; E′) if L ⊆ L′, R ⊆ R ′ and E ⊆ E′. In this paper we present sufficient degree conditions for a bipartite graph to contain a (p, q)-tree
Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if...
AbstractA graph G is said to be (p1,p2) be-embeddable if there exist two subgraphs H1 and H2 of G wi...
AbstractA bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In...
A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-...
Let G = (L,R;E) be a bipartite graph such that V(G) = L∪R, |L| = p and |R| = q. G is called (p,q)-tr...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known t...
In this paper we consider \(2\)-biplacement without fixed points of paths and \((p,q)\)-bipartite gr...
AbstractLet G and H be two simple graphs on p vertices. We give a sufficient condition, based on the...
In this thesis we present two results in Extremal Graph Theory. The first result is a new proof of a...
Abstract. In this paper we consider 2-biplacement without fixed points of paths and (p, q)-bipartite...
In this paper we consider 2-biplacement without fixed points of paths and (p, q)--bipartite graphs o...
AbstractWe prove that for any prime number p the complete bipartite graph Kp,p has, up to isomorphis...
In this paper we propose a structural characterization for a class of bipartite graphs defined by tw...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if...
AbstractA graph G is said to be (p1,p2) be-embeddable if there exist two subgraphs H1 and H2 of G wi...
AbstractA bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In...
A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-...
Let G = (L,R;E) be a bipartite graph such that V(G) = L∪R, |L| = p and |R| = q. G is called (p,q)-tr...
AbstractIn this paper we shall show that if G = (V, E) is a bipartite graph with more than (a − 1)‖Y...
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known t...
In this paper we consider \(2\)-biplacement without fixed points of paths and \((p,q)\)-bipartite gr...
AbstractLet G and H be two simple graphs on p vertices. We give a sufficient condition, based on the...
In this thesis we present two results in Extremal Graph Theory. The first result is a new proof of a...
Abstract. In this paper we consider 2-biplacement without fixed points of paths and (p, q)-bipartite...
In this paper we consider 2-biplacement without fixed points of paths and (p, q)--bipartite graphs o...
AbstractWe prove that for any prime number p the complete bipartite graph Kp,p has, up to isomorphis...
In this paper we propose a structural characterization for a class of bipartite graphs defined by tw...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
Abstract. Let G = (V1, V2, E) be a bipartite graph. Then G is called cocom-plete bipartite graph, if...
AbstractA graph G is said to be (p1,p2) be-embeddable if there exist two subgraphs H1 and H2 of G wi...
AbstractA bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In...