Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.68628MaRDI QIDQ5897553FDOQ5897553

Authors: Van Bang Le, Raffaele Mosca, Haiko Müller 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• On stable cutsets in claw-free graphs and planar graphs
• On stable cutsets in line graphs
• scientific article; zbMATH DE number 2044944
• On stable cutsets in graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cited In (5)

• On stable cutsets in line graphs
• Title not available (Why is that?)
• On stable cutsets in graphs
• On the stable degree of graphs
• On stable cutsets in claw-free graphs and planar graphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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