Incidence coloring on hypercubes

DOI10.1016/j.tcs.2014.08.017zbMath1339.05144OpenAlexW2015288268MaRDI QIDQ300251

Ro-Yu Wu, Kung-Jui Pai, Jou-Ming Chang, Jinn-Shyong Yang

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.017

zbMATH Keywords

hypercubesCartesian product of graphsHamming codesincidence coloringindependent perfect domination

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On incidence coloring conjecture in Cartesian products of graphs ⋮ On incidence coloring of graph fractional powers ⋮ Unnamed Item ⋮ Corrigendum to: ``Incidence coloring on hypercubes. ⋮ Incidence coloring of mycielskians with fast algorithm ⋮ Incidence coloring of Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on the incidence coloring number of a graph
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• On incidence coloring for some cubic graphs
• The incidence coloring numbers of meshes
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Error Detecting and Error Correcting Codes