The incidence coloring numbers of meshes

DOI10.1016/J.CAMWA.2004.02.006zbMATH Open1062.05059OpenAlexW2055316805MaRDI QIDQ1779599FDOQ1779599

Authors: Cheng-I. Huang, Yue-Li Wang, Sheng-Shiung Chung 

Publication date: 1 June 2005

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.02.006

Recommendations

• On incidence coloring for some cubic graphs
• Cubic graphs with different incidence chromatic numbers
• The incidence coloring conjecture for graphs of maximum degree 3
• Incidence coloring of mycielskians with fast algorithm
• The incidence chromatic number of some graph

zbMATH Keywords

Interconnection networksHexagonal meshesHoneycomb meshesSquare meshes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• On incidence coloring for some cubic graphs
• The star arboricity of graphs

Cited In (9)

• The incidence game chromatic number
• The incidence game chromatic number of paths and subgraphs of wheels
• Incidence coloring on hypercubes
• On incidence coloring conjecture in Cartesian products of graphs
• Incidence coloring of mycielskians with fast algorithm
• The incidence chromatic number of some graph
• On incidence coloring for some cubic graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• Incidence coloring of Cartesian product graphs

This page was built for publication: The incidence coloring numbers of meshes

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