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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Partitioning Graphs into Induced Subgraphs
description / endescription / en
scientific article
scientific article; zbMATH DE number 6725148
Property / title
 
Partitioning Graphs into Induced Subgraphs (English)
Property / title: Partitioning Graphs into Induced Subgraphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1487.68181 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-53733-7_25 / rank
 
Normal rank
Property / published in
 
Property / published in: Language and Automata Theory and Applications / rank
 
Normal rank
Property / publication date
 
1 June 2017
Timestamp+2017-06-01T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 1 June 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6725148 / rank
 
Normal rank
Property / zbMATH Keywords
 
generalized matching
Property / zbMATH Keywords: generalized matching / rank
 
Normal rank
Property / zbMATH Keywords
 
parametrized complexity
Property / zbMATH Keywords: parametrized complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022092465 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962770195 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.04725 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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