Abstract
Combinatorial method is a very effective method to study Karp conjecture. The combinatorial method was first used to prove that many graph properties are elusive. An important combinatorial technique developed during this period was summarized by Milner and Welsh as the Milner-Welsh Theorem, which has an important application in determining the complexity of decision trees of graphic properties. In this paper, we give two important propositions about the Milner-Welsh theorem, and use these propositions to judge the elusive of the connectivity of graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
