scientific article; zbMATH DE number 7272506
From MaRDI portal
Publication:5133651
zbMath1451.05118MaRDI QIDQ5133651
Christina M. Mynhardt, Shahla Nasserasr
Publication date: 10 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
Hamiltonian cycles and 1-factors in 5-regular graphs ⋮ Irredundance trees of diameter 3 ⋮ Optimally reconfiguring list and correspondence colourings ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ On the complexity of distance-\(d\) independent set reconfiguration ⋮ Parameterized complexity of optimizing list vertex-coloring through reconfiguration ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ On reconfiguration graphs of independent sets under token sliding ⋮ Reconfiguration graphs of zero forcing sets ⋮ Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters ⋮ Decremental optimization of vertex-coloring under the reconfiguration framework ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Linear transformations between dominating sets in the TAR-model ⋮ \(\gamma\)-graphs of trees ⋮ Dominating sets reconfiguration under token sliding ⋮ Reconfiguration graphs for dominating sets ⋮ Hamilton paths in dominating graphs of trees and cycles
This page was built for publication:
