scientific article; zbMATH DE number 1944137
From MaRDI portal
Publication:4407445
zbMath1039.05031MaRDI QIDQ4407445
Publication date: 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
Hadwiger's conjecture for circular colorings of edge-weighted graphs ⋮ Mixed hypergraphs and other coloring problems ⋮ Distance Constrained Labelings of Trees ⋮ The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks ⋮ Channel assignment on graphs of bounded treewidth ⋮ Graph labellings with variable weights, a survey ⋮ An exact algorithm for the channel assignment problem ⋮ On the span in channel assignment problems: Bounds, computing and counting ⋮ Homomorphisms of hexagonal graphs to odd cycles ⋮ Radio fuzzy graphs and assignment of frequency in radio stations ⋮ Perfectness and imperfectness of unit disk graphs on triangular lattice points ⋮ Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
This page was built for publication:
