Pair lengths of product graphs

DOI10.1016/j.disc.2006.04.006zbMath1101.05051OpenAlexW2018316817MaRDI QIDQ2501549

Demetres Christofides

Publication date: 14 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.006

zbMATH Keywords

graph automorphism\(k\)-pairable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (2)

On \(k\)-pairable regular graphs ⋮ Uniquely pairable graphs

Cites Work

• Unnamed Item
• Retracts of strong products of graphs
• Graph multiplication
• On \(k\)-pairable graphs
• New Tricks for Old Trees: Maps and the Pigeonhole Principle

This page was built for publication: Pair lengths of product graphs