scientific article; zbMATH DE number 2044944

MaRDI QIDQ4448765zbMATH OpenFDO

Authors Van Bang Le, Bert Randerath

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040263.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On stable cutsets in line graphs
• Graph-Theoretic Concepts in Computer Science
• On stable cutsets in claw-free graphs and planar graphs
• On stable cutsets in graphs
• Matching cutsets in graphs

Cited in

(7)

• On stable cutsets in line graphs
• On stable cutsets in graphs
• Vertex partitioning problems on graphs with bounded tree width
• scientific article; zbMATH DE number 1161313 (Why is no real title available?)
• On the stable degree of graphs
• Graph-Theoretic Concepts in Computer Science
• On stable cutsets in claw-free graphs and planar graphs

This page was built for publication:

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