MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

DOI10.1080/16073606.1993.9631742zbMATH Open0794.05124OpenAlexW1988435199MaRDI QIDQ4288050FDOQ4288050

Authors: Terri Wilhite Johnson, Peter Slater 

Publication date: 21 April 1994

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1993.9631742

Recommendations

• scientific article; zbMATH DE number 4150229
• The complexity of some problems on maximal independent sets in graphs
• Maximum independent sets in graphs of low degree
• Independence and irredundance in \(k\)-regular graphs
• On disjoint maximal independent sets in graphs

zbMATH Keywords

NP-hardmaximum independent setseries-parallel graphsminimum total redundance

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• A recurrence template for several parameters in series-parallel graphs
• Some simplified NP-complete graph problems
• Graph minors. II. Algorithmic aspects of tree-width
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Title not available (Why is that?)
• A linear algorithm for the domination number of a series-parallel graph
• Title not available (Why is that?)

Cited In (3)

• A recurrence template for several parameters in series-parallel graphs
• Title not available (Why is that?)
• Maximum series-parallel subgraph

This page was built for publication: MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288050)