Odd cycles and a class of facets of the axial 3-index assignment polytope
Page 1 Next
R. Euler (1987)
Applicationes Mathematicae
Ivan Havel, Bohdan Zelinka (2001)
Discussiones Mathematicae Graph Theory
We deal with the graph operator defined to be the complement of the square of a graph: . Motivated by one of many open problems formulated in [6] we look for graphs that are 2-periodic with respect to this operator. We describe a class of bipartite graphs possessing the above mentioned property and prove that for any m,n ≥ 6, the complete bipartite graph can be decomposed in two edge-disjoint factors from . We further show that all the incidence graphs of Desarguesian finite projective geometries...
Marián Trenkler (1989)
Mathematica Slovaca
Jozef Jirásek (1987)
Commentationes Mathematicae Universitatis Carolinae
M. Michalski (1987)
Applicationes Mathematicae
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Nelson, Donald, Plummer, Michael D., Robertson, Neil, Zha, Xiaoya (2011)
The Electronic Journal of Combinatorics [electronic only]
K. Bezdek, A. Bezdek (1989)
Elemente der Mathematik
Elena Wisztová (1991)
Mathematica Bohemica
In this paper the following theorem is proved: Let be a connected graph of order and let be a matching in . Then there exists a hamiltonian cycle of such that .
E. Kolasińska (1980)
Applicationes Mathematicae
Vítězslav Novák, Miroslav Novotný (1984)
Časopis pro pěstování matematiky
Horak, Peter, Rosa, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Charles Delorme, Marie-Claude Heydemann (1999)
Annales de l'institut Fourier
In 1995, F. Jaeger and M.-C. Heydemann began to work on a conjecture on binary operations which are related to homomorphisms of De Bruijn digraphs. For this, they have considered the class of digraphs such that for any integer , has exactly walks of length , where is the order of . Recently, C. Delorme has obtained some results on the original conjecture. The aim of this paper is to recall the conjecture and to report where all the authors arrived.
Sylwia Cichacz, Irmina A. Zioło (2006)
Discussiones Mathematicae Graph Theory
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n₁,...,nₖ) of positive integers such that , there exists a partition (V₁,...,Vₖ) of vertex set of G such that for every i ∈ 1,...,k the set induces a connected subgraph of G on vertices. We consider arbitrarily vertex decomposable unicyclic graphs with dominating cycle. We also characterize all such graphs with at most four hanging vertices such that exactly two of them have a common neighbour.
Ladislav Nebeský (1990)
Časopis pro pěstování matematiky
O'Keefe, M., Wong, P.K. (1984)
International Journal of Mathematics and Mathematical Sciences
Farrell, E.J. (1985)
International Journal of Mathematics and Mathematical Sciences
Farrell, E.J. (1984)
International Journal of Mathematics and Mathematical Sciences
Page 1 Next