Constructions for Nonhamiltonian Burkard-Hammer Graphs
A graph G = (V,E) is called a split graph if there exists a partition V = I ∪ K such that the subgraphs G[I ] and G[K] of G induced by I and K are empty and complete graphs, respectively. In 1980, Burkard and Hammer gave a necessary condition for split graphs with |I |<|K| to be hamiltonian. This condition is not sufficient. In this paper, we give two constructions for producing infinite families of split graphs with |I |<|K|, which satisfy the Burkard-Hammer condition but have no Hamilton cycles.
KeywordsBipartite Graph Complete Graph Minimum Degree Hamilton Cycle Hamilton Path
Unable to display preview. Download preview PDF.
- 2.Brandstädt, A., Hammer, P.L., Le, V.B., Lozin, V.V.: Bisplit graphs. Rutcor Research Report RRR 28-2002 (October 2002)Google Scholar
- 5.Foldes, S., Hammer, P.L.: Split graphs. In: Proc. 8-th Southeast Conf. on Combin., Graph Theory and Comput (Louisiana State Univ., Baton Rouge, La 1977), Congressus Numerantium, No XIX, Utilitas Math., Winnipeg, Man, pp. 311–315 (1977)Google Scholar
- 6.Foldes, S., Hammer, P.L.: On a class of matroid-producing graphs. In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely 1976). Colloq. Math. Soc. Janós Bolyai 18, vol. 1, pp. 331–352. North-Holland, Amsterdam (1978)Google Scholar
- 7.Peled, U.N.: Regular Boolean functions and their polytope. Chapter VI, Ph. D. Thesis, Univ. of Waterloo, Dept. Combin. and Optimization (1975)Google Scholar
- 9.Tan, N.D., Le Hung, X.: On the Burkard-Hammer condition for hamiltonian split graphs. Preprint 2002/25, Institute of Mathematics, Hanoi, Vietnam (2002) (submitted)Google Scholar