1990 | OriginalPaper | Chapter
A Las-Vergnas Type Theorem for Trees
Authors : I. Krasikov, Y. Roditty
Published in: Topics in Combinatorics and Graph Theory
Publisher: Physica-Verlag HD
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Let G be a connected simple graph. We study the maximal order of a subisce T ⊂ G with a given maximum degree Δ T . We obtained conditions on the degree sequence of a graph which are similar to that of Bondy and Las-Vergnas on the Hamilton cycle, and strengthen early results of Win |10| and the authors [4].