scientific article; zbMATH DE number 1202982
From MaRDI portal
Publication:4209364
zbMath0905.68100MaRDI QIDQ4209364
Pinar Heggernes, Jan Arne Telle
Publication date: 11 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
An improved exact algorithm for the domatic number problem ⋮ A Taxonomy of Perfect Domination ⋮ A note on non-dominating set partitions in graphs ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Perfect matching cuts partitioning a graph into complementary subgraphs ⋮ Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems ⋮ Connectivity for some families of composition networks ⋮ Finding matching cuts in \(H\)-free graphs ⋮ On incidence coloring of complete multipartite and semicubic bipartite graphs ⋮ Parameterized complexity of generalized domination problems ⋮ Finding perfect matching cuts faster ⋮ Injective coloring of graphs revisited ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ Distance-two colourings of Barnette graphs ⋮ Maximal independent sets in minimum colorings ⋮ Role colouring graphs in hereditary classes ⋮ A survey of selected recent results on total domination in graphs ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ Fall colouring of bipartite graphs and Cartesian products of graphs ⋮ Some results for the two disjoint connected dominating sets problem ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Complexity of fall coloring for restricted graph classes ⋮ The perfect matching cut problem revisited ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ The perfect matching cut problem revisited ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Partitioning the Vertices of a Graph into Two Total Dominating Sets ⋮ Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees ⋮ Injective colouring for H-free graphs ⋮ A complete complexity classification of the role assignment problem
This page was built for publication:
