Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles

DOI10.1142/S0129626419500166zbMath1492.05039OpenAlexW2995951609WikidataQ126531277 ScholiaQ126531277MaRDI QIDQ5087858

Colton Magnant, Ajay Arora, Eddie Cheng

Publication date: 4 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626419500166

zbMATH Keywords

Cartesian productproper coloringsproper distance

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Proper connection of graphs
• Proper distance in edge-colored hypercubes
• Number of proper paths in edge-colored hypercubes
• Properly Colored Connectivity of Graphs
• Unnamed Item

This page was built for publication: Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles