Record Details

Triangle-factors in powers of graphs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Triangle-factors in powers of graphs
 
Creator AGARWAL, NARENDRA
DIWAN, AJIT A
 
Subject computational geometry
graph theory
probability
 
Description In this paper, we investigate existence of triangle-factors, that is 2-factors in which every cycle is of length 3, in powers of graphs of order 3k,k ≥ 1. It is easy to show that G4 contains a triangle-factor for any connected graph and G3 contains a triangle-factor for any connected claw-free graph G. Our main result is that G3 contains a triangle-factor for any 2-connected graph G. We also show, using the same method, that any 2-connected claw-free graph contains a P3-factor which implies that the square of the graph contains a triangle-factor.
 
Publisher Elsevier
 
Date 2009-05-09T09:16:16Z
2011-12-08T07:03:03Z
2011-12-26T13:01:56Z
2011-12-27T05:47:41Z
2009-05-09T09:16:16Z
2011-12-08T07:03:03Z
2011-12-26T13:01:56Z
2011-12-27T05:47:41Z
2003
 
Type Article
 
Identifier Electronic Notes in Discrete Mathematics 15, 23-25
1571-0653
10.1016/S1571-0653(04)00513-X
http://hdl.handle.net/10054/1318
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1318
 
Language en