Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles

DOI10.1002/jgt.22180zbMath1386.05051arXiv1612.03298OpenAlexW2563840204MaRDI QIDQ4638651

No author found.

Publication date: 27 April 2018

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

Full work available at URL: https://arxiv.org/abs/1612.03298

zbMATH Keywords

2-factor1-factorHamiltonian cyclepolychromatic coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Polychromatic colorings of hypergraphs with high balance ⋮ Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs ⋮ The polychromatic number of small subsets of the integers modulo \(n\)

This page was built for publication: Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles