Add to ORKGIn this paper we consider 2-biplacement without fixed points of paths and (p, q)--bipartite graphs of small size. We give all (p, q)-bipartite graphs G of size q for which the set S*(G) of all 2-biplacements of G without fixed points is empty
The following is proved: If G is a labeled (p,p−2) graph where p≥2, then there exists an isomorphic ...
Bipartite graphs G = (L; R; E) and H = (L0; R0; E0) are bi-placeabe if there is a bijection f: L [ R...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
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 gr...
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...
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 bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or ...
AbstractIt has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that brid...
A -bisection of a bridgeless cubic graph G is a 2-colouring of its vertex set such that the colour c...
AbstractWe prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite gr...
We consider bipartite graphs of degree ∆≥2, diameter D=3, and defect 2 (having 2 vertices less than ...
AbstractWe give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipa...
The following is proved: If G is a labeled (p,p−2) graph where p≥2, then there exists an isomorphic ...
Bipartite graphs G = (L; R; E) and H = (L0; R0; E0) are bi-placeabe if there is a bijection f: L [ R...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
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 gr...
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...
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 bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-...
AbstractUsing a clever inductive counting argument Erdős, Kleitman and Rothschild showed that almost...
We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or ...
AbstractIt has been shown by MacGillivray and Seyffarth (Austral. J. Combin. 24 (2001) 91) that brid...
A -bisection of a bridgeless cubic graph G is a 2-colouring of its vertex set such that the colour c...
AbstractWe prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite gr...
We consider bipartite graphs of degree ∆≥2, diameter D=3, and defect 2 (having 2 vertices less than ...
AbstractWe give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipa...
The following is proved: If G is a labeled (p,p−2) graph where p≥2, then there exists an isomorphic ...
Bipartite graphs G = (L; R; E) and H = (L0; R0; E0) are bi-placeabe if there is a bijection f: L [ R...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...