On three polynomial kernels of sequences for arbitrarily partitionable graphs
From MaRDI portal
Recommendations
- On partition functions for 3-graphs
- Partition problems and kernels of graphs
- On sequences of polynomials arising from graph invariants
- Polynomial kernels for \textsc{Dominating Set} in graphs of bounded degeneracy and beyond
- The Kauffman polynomial and trivalent graphs
- A polynomial characterization of some graph partitioning problems
- On the complexity of the 3-kernel problem in some classes of digraphs
- Polynomial kernels for 3-leaf power graph modification problems
- Polynomial kernels for 3-leaf power graph modification problems
- Convex partitions of graphs induced by paths of order three
Cites work
- A degree bound on decomposable trees
- Analytic combinatorics
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- Fully decomposable split graphs
- On the complexity of partitioning a graph into a few connected subgraphs
- On the complexity of partitioning graphs into connected subgraphs
- Partitioning Harary graphs into connected subgraphs containing prescribed vertices
- Partitioning powers of traceable or Hamiltonian graphs
- Paths, Trees, and Flowers
Cited in
(5)
This page was built for publication: On three polynomial kernels of sequences for arbitrarily partitionable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962512)
