A note on fragile graphs
From MaRDI portal
Publication:1598838
DOI10.1016/S0012-365X(01)00226-6zbMath0991.05079WikidataQ127008589 ScholiaQ127008589MaRDI QIDQ1598838
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Algorithms Solving the Matching Cut Problem ⋮ On stable cutsets in line graphs ⋮ Algorithms solving the matching cut problem ⋮ 3-consecutive edge coloring of a graph ⋮ On stable cutsets in claw-free graphs and planar graphs
This page was built for publication: A note on fragile graphs
