Maximum independent sets in subcubic graphs: new results (Q5919020): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(One intermediate revision by one other user not shown) | |||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 7173289 | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1464.68286 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-030-30786-8_4 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Graph-Theoretic Concepts in Computer Science / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
24 February 2020
| |||||||||||||||
Property / publication date: 24 February 2020 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 7173289 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
independent set | |||||||||||||||
Property / zbMATH Keywords: independent set / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
sub-cubic graphs | |||||||||||||||
Property / zbMATH Keywords: sub-cubic graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
apple-free graphs | |||||||||||||||
Property / zbMATH Keywords: apple-free graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2973220794 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Struction revisited / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Treewidth for graphs with small chordality / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Maximum independent sets in subcubic graphs: new results / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: From matchings to independent sets / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Graphs without large apples and the maximum weight independent set problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the maximum independent set problem in subclasses of subcubic graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Computing independent sets in graphs with large girth / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Decomposition by clique separators / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An algorithm for finding clique cut-sets / rank | |||||||||||||||
Normal rank |
Latest revision as of 00:39, 24 July 2024
scientific article; zbMATH DE number 7173289
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum independent sets in subcubic graphs: new results |
scientific article; zbMATH DE number 7173289 |
Statements
Maximum independent sets in subcubic graphs: new results (English)
0 references
6 November 2020
0 references
24 February 2020
0 references
maximum independent set
0 references
subcubic graph
0 references
polynomial algorithm
0 references
independent set
0 references
sub-cubic graphs
0 references
apple-free graphs
0 references
0 references