Triangle-factors in powers of graphs

DOI10.1016/S1571-0653(04)00513-XMaRDI QIDQ3439011zbMATH OpenOpenAlexFDO

Authors Narendra Agarwal, Ajit A. Diwan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00513-x

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On a 1-factor of the fourth power of a connected graph
• Publication:3487420
• Path-factors in the square of a tree
• 2-factors in triangle-free graphs
• 2-factors in claw-free graphs

Cites work

• A new proof of the theorem by Fleischner
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• On packing 3-vertex paths in a graph
• The square of every two-connected graph is Hamiltonian

Cited in

(4)

• On a 1-factor of the fourth power of a connected graph
• scientific article; zbMATH DE number 1080948 (Why is no real title available?)
• Triangle‐factors in pseudorandom graphs
• Path-factors in the square of a tree

This page was built for publication: Triangle-factors in powers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439011)