Proper distance in edge-colored hypercubes

DOI10.1016/J.AMC.2017.05.065zbMath1426.05023OpenAlexW2649467761MaRDI QIDQ1740062

Dhruv Medarametla, Eddie Cheng, Colton Magnant

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.05.065

zbMATH Keywords

hypercubeedge-coloringproper connection

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (3)

A Remark on Rainbow 6-Cycles in Hypercubes ⋮ Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles ⋮ Number of proper paths in edge-colored hypercubes

Cites Work

• A survey of the theory of hypercube graphs
• A stochastic process on the hypercube with applications to peer-to-peer networks

This page was built for publication: Proper distance in edge-colored hypercubes