Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
From MaRDI portal
Publication:354461
DOI10.1007/s00373-012-1164-0zbMath1268.05050arXiv1710.05936OpenAlexW2103437676MaRDI QIDQ354461
M. Amin Bahmanian, C. A. Rodger
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.05936
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph designs and isomorphic decomposition (05C51)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- Generalized latin rectangles I: Construction and decomposition
- On the decomposition of a graph into stars
- Generalized latin rectangles. II: Embedding
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
- Amalgamations of connected \(k\)-factorizations.
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- 4-Cycle Group-Divisible Designs with Two Associate Classes
- Cycle decompositions III: Complete graphs and fixed length cycles
- Multiply balanced edge colorings of multigraphs
- Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
- An existence theorem for latin squares
This page was built for publication: Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
