On hypercube labellings and antipodal monochromatic paths

DOI10.1016/J.DAM.2012.12.025MaRDI QIDQ2446321zbMATH OpenOpenAlexFDO

Authors Tomás Feder, Carlos Subi

Publication date 16 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.12.025

zbMATH Keywords

hypercubemonochromaticgraph labellingantipodal path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Antipodal edge-colorings of hypercubes
• A note on Norine's antipodal-colouring conjecture
• Path coverings with prescribed ends of the \(n\)-dimensional binary hypercube
• On the 1-switch conjecture
• Number of proper paths in edge-colored hypercubes

Cited in

(9)

• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• Long geodesics in subgraphs of the cube
• Antipodal edge-colorings of hypercubes
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
• A note on Norine's antipodal-colouring conjecture
• On the central levels problem
• MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
• On the 1-switch conjecture

This page was built for publication: On hypercube labellings and antipodal monochromatic paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446321)