scientific article; zbMATH DE number 921905
From MaRDI portal
Publication:4892794
zbMath0858.94024MaRDI QIDQ4892794
Publication date: 13 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypackingsrandom graphsperfect codesnonexistence resultsdominating setsdistance regular graphsSeidel's switchingCartesian powers of graphs
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)
Related Items
Parameterized Complexity in Multiple-Interval Graphs: Domination ⋮ Regular codes in regular graphs are difficult ⋮ A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems ⋮ When an optimal dominating set with given constraints exists ⋮ Parameterized complexity of generalized domination problems ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy ⋮ Efficient domination for classes of \(P_6\)-free graphs ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ Perfect codes in direct products of cycles
