Partitioning graphs into induced subgraphs (Q2283104): Difference between revisions

From MaRDI portal
Merged Item from Q5739009
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by the same user not shown)
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Partitions of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539854 / rank
 
Normal rank

Latest revision as of 07:57, 21 July 2024

scientific article; zbMATH DE number 6725148
  • Partitioning Graphs into Induced Subgraphs
Language Label Description Also known as
English
Partitioning graphs into induced subgraphs
scientific article; zbMATH DE number 6725148
  • Partitioning Graphs into Induced Subgraphs

Statements

Partitioning graphs into induced subgraphs (English)
0 references
Partitioning Graphs into Induced Subgraphs (English)
0 references
0 references
30 December 2019
0 references
1 June 2017
0 references
graph matching
0 references
graph partitioning
0 references
parameterized complexity
0 references
dense graphs
0 references
generalized matching
0 references
parametrized complexity
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references