Embedding an edge‐coloring of K(nr;λ1,λ2) into a Hamiltonian decomposition of K(nr+2;λ1,λ2)

DOI10.1002/JGT.22468zbMath1495.05248OpenAlexW2961132139MaRDI QIDQ5110644

M. Demir, C. A. Rodger

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22468

zbMATH Keywords

decompositionembeddingedge-coloringamalgamationsdetachments

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Embedding an edge‐coloring of K(nr;λ1,λ2) into a Hamiltonian decomposition of K(nr+2;λ1,λ2)