Wiener Indices and Polynomials of Five Graph Operators Weigen Yan∗ School of Sciences, Jimei University Xiamen, China, and Academia Sinica Taipei, Taiwan

First Page		Document Content
Date: 2011-03-20 04:03:37 Graph theory Mathematics Graph operations Graph coloring Line graph Graph End Ear decomposition Edge contraction Shortest Path Faster Algorithm		Wiener Indices and Polynomials of Five Graph Operators Weigen Yan∗ School of Sciences, Jimei University Xiamen, China, and Academia Sinica Taipei, Taiwan Add to Reading List Source URL: precision.moscito.org Download Document from Source Website File Size: 170,14 KB Share Document on Facebook

	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document
	On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´ DocID: 1r321 - View Document
	VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF DocID: 1qRaE - View Document
	Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma DocID: 1qMoS - View Document
	Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1 DocID: 1qvfC - View Document