Incidence coloring of mycielskians with fast algorithm

DOI10.1016/j.tcs.2021.05.026OpenAlexW3165493120MaRDI QIDQ2043007

Huimin Bi, Xin Zhang

Publication date: 22 July 2021

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

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

zbMATH Keywords

frequency assignment problemincidence coloringMycielskiancubic-time algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Hypergraph incidence coloring ⋮ Defective incidence coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incidence coloring on hypercubes
• On incidence coloring conjecture in Cartesian products of graphs
• Elementary landscape decomposition of the frequency assignment problem
• Incidence coloring of pseudo-Halin graphs
• Maximum scan statistics and channel assignment problems in homogeneous wireless networks
• A constructive proof of Vizing's theorem
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• On incidence coloring for some cubic graphs
• On incidence coloring of complete multipartite and semicubic bipartite graphs
• The incidence coloring numbers of meshes
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• On \((p, 1)\)-total labelling of some 1-planar graphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Incidence coloring -- cold cases
• Anti-\(k\)-labeling of graphs
• List \(r\)-dynamic coloring of sparse graphs
• The incidence chromatic number of toroidal grids

This page was built for publication: Incidence coloring of mycielskians with fast algorithm