Transitive path decompositions of Cartesian products of complete graphs

DOI10.1007/s10623-024-01493-9MaRDI QIDQ6651915

Ajani De Vas Gunasekara, Alice Devillers

Publication date: 11 December 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

path decompositionsCartesian products of graphsgroup actions on graphstransitive decompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Gallai's path decomposition conjecture for graphs of small maximum degree
• \(G\)-designs and related designs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Constructing homogeneous factorisations of complete graphs and digraphs
• Covering the edges of a connected graph by paths
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Decompositions of 6-regular bipartite graphs into paths of length six
• Transitive Decompositions of Graphs and Their Links with Geometry and Origami
• Path decompositions of digraphs
• Algorithms – ESA 2004
• Decomposition of product graphs into paths and cycles of length four
• Path decompositions of tournaments

This page was built for publication: Transitive path decompositions of Cartesian products of complete graphs

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