A method of graph reduction and its applications
type: Item
instance of: scholarly article
title: A method of graph reduction and its applications
zbMATH Open document ID: 1394.05094
author: Dmitrii V. Sirotkin
author: D. S. Malyshev
published in: Discrete Mathematics and Applications
publication date: 2018-09-03T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6930960
zbMATH Keywords: independent sets
zbMATH Keywords: planar graph
zbMATH Keywords: planar triangulation
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: dma-2018-0022
OpenAlex ID: W2888414688
cites work: Q3893327
cites work: Local transformations of graphs preserving independence number
cites work: Q3115672
cites work: Some simplified NP-complete graph problems
cites work: Efficient Planarity Testing
cites work: On the Maximum Independent Set Problem in Subclasses of Planar Graphs
cites work: On the maximum independent set problem in subclasses of subcubic graphs
cites work: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
Wikidata QID: Q129354095
DOI: 10.1515/DMA-2018-0022
Recommended article: Q3032302
Recommended article: Reduction graph and its application on algebraic graphs
Recommended article: Q4037299
Recommended article: An algebraic theory of graph reduction
Recommended article: Q4222821
Recommended article: Q4025927
Recommended article: New methods for reducing size graphs
Recommended article: A reduction of the graph reconstruction conjecture
Recommended article: An algorithm for transitive reduction of an acyclic graph
Recommended article: Reductions to graph isomorphism
description: scientific article; zbMATH DE number 6930960