Powers of asteroidal triple-free graphs with applications

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/32123

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/32123

Title:	Powers of asteroidal triple-free graphs with applications
Authors:	Chang,JM;Ho,CW;Ko,MT
Contributors:	資訊工程研究所
Keywords:	COCOMPARABILITY GRAPHS;CHORDAL GRAPHS;DOMINATION;PATH;ALGORITHMS;PAIRS
Date:	2003
Issue Date:	2010-07-06 18:19:07 (UTC+8)
Publisher:	中央大學
Abstract:	An asteroidal triple is an independent set of three vertices in a graph such that every two of them are joined by a path avoiding the closed neighborhood of the third. Graphs without asteroidal triples are called AT-free graphs. In this paper, we show tha
Relation:	ARS COMBINATORIA
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	379	View/Open

社群 sharing