Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
From MaRDI portal
Publication:5936032
DOI10.1016/S0012-365X(00)00241-7zbMath0983.05031OpenAlexW2074755942MaRDI QIDQ5936032
Publication date: 16 April 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00241-7
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Distributive online channel assignment for hexagonal cellular networks with constraints ⋮ Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable ⋮ 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs ⋮ Asymptotically sharpening the $s$-Hamiltonian index bound ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs] ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs ⋮ IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS ⋮ Hamiltonian properties of triangular grid graphs ⋮ Online call control in cellular networks revisited ⋮ Homomorphisms of hexagonal graphs to odd cycles ⋮ A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs ⋮ Graph imperfection. I ⋮ 2-local distributed algorithms for generalized coloring of hexagonal graphs
This page was built for publication: Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
