مرکز منطقه ای اطلاع رساني علوم و فناوري - Bounding the Number of Graphs Containing Very Long Induced Paths

DocumentCode :

19575

Title :

Bounding the Number of Graphs Containing Very Long Induced Paths

University :

Brighan Young University Browse

Grade :

نامعلوم

Major :

PhD )Mathematics(

Number of pages :

Publish Date :

2003

Keyword :

Mathematics , Combinatorics , graph theory , paths , induced paths , asymptotic behavior , stirling numbers , polya counting , Burnsides theorem

Note :

Language :

انگليسي

Link To Document :