Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In 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.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
269--274
Opis fizyczny
Bibliogr. 6 poz.
Twórcy
autor
- AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Kraków, Poland, orchel@agh.edu.pl
Bibliografia
- [1] Burns D., Schuster S.: Embedding (p,p — 1) graphs in their complements. Israel J. Math. 30 (1978), 313-320.
- [2] Catlin P. A.: Subgraphs of graphs. I. Discrete Math. 10 (1974), 225-233.
- [3] Fouquet J.- L., Wojda A. P.: Mutual placement of bipartite grahps. Discrete Math. 121 (1993) 85-92.
- [4] Rado R.: A theorem on a general measure functions. Proc. London Math. Soc. 44 (2) (1938), 61-91.
- [5] Schuster S.: Fixed-point-free embeddings in graphs in their complements. Internat. J. Math. Sci. 1 (1978), 335-338.
- [6] Wojda A. P., Vanderlind P.: Packing bipartite graphs. Discrete Math. 164 (1997), 303-311.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-AGH4-0003-0049