A nine-vertex theorem for 3-connected claw-free graphs. In: Workshop on Hypergraphs (June 4-17 2001) and Conference on Hypergraphs (Gyula O.H. Katona is 60) June 7-9, 2001. Budapest: Rényi Institute; 2001. p. 79-89. Abstract
A nine-vertex theorem for 3-connected claw-free graphs
Workshop on Hypergraphs (June 4-17 2001)and Conference on Hypergraphs (Gyula O.H. Katona is 60)June 7-9, 2001,Rényi Institute, Budapest, Hungary
A nine vertex theorem for 3-connected claw- free graphs. Studia Scientiarum Mathematicarum Hungarica. 2001;38(1-4):233-44.
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discrete Mathematics. 1992;101(1-3):87-96.