scientific article
From MaRDI portal
Publication:2768335
zbMath0999.05092MaRDI QIDQ2768335
Publication date: 14 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Algorithms for vertex-partitioning problems on graphs with fixed clique-width. ⋮ Parameterized complexity of distance labeling and uniform channel assignment problems ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Improved bottleneck domination algorithms ⋮ Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems ⋮ Graph Classes with Structured Neighborhoods and Algorithmic Applications ⋮ Edge dominating set and colorings on graphs with fixed clique-width
This page was built for publication:
