Triangle-factors in powers of graphs

DOI10.1016/S1571-0653(04)00513-XzbMath1184.05093OpenAlexW2081507833MaRDI QIDQ3439011

Ajit A. Diwan, Narendra Agarwal

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)

Cites Work

• Unnamed Item
• A new proof of the theorem by Fleischner
• The square of every two-connected graph is Hamiltonian
• On packing 3-vertex paths in a graph

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